1 |
Vazirani, V. V., Approximation algorithms, Springer, Berlin, 2001
|
2 |
McCormick, S. T., M. R. Rao, and G. Rinaldi, Easy and difficult objective functions for max cut, Math. Program, Ser. B 94 (2003) 459-466
DOI
|
3 |
Goemans, M. X. and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. ACM 42 (1995) 1115-1145
DOI
|
4 |
Matula, D. W. and F. Shahrokhi, Sparsest cuts and bottleneck in graphs, Discrete Appl. Math., 27 (1990) 113-123
DOI
ScienceOn
|