Graph partitioning and continuous quadratic programming

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 4, 1999, Pages 500-523

  Hager, William W ^a   Krylyuk, Yaroslav ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Edge separators; Fiedler vector; Graph Laplacian; Graph partitioning; Max cut; Min cut; Optimality conditions; Quadratic programming

Indexed keywords

EID: 0001101633     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199335829     Document Type: Article

References (45)

1. A. A. AGEEV AND M I. SVIRIDENKO, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1610, G. C. Cornuéjols, R. E. Burkard, and G. J. Woeginger, eds., Springer, Berlin, 1999, pp. 17-30.
2. R K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network flows, in Optimization, Handbooks in Oper. Res. and Management Sci. 1, G. L. Nemhauser, A. H G. Rinnooy Kan, and M. J. Todd, eds. North-Holland, Amsterdam, 1989, pp. 211-369.
3. C. J. ALPERT AND A. B. KAHNG, Recent directions in netlist partition: A survey, Integration, the VLSI Journal, 19 (1995), pp. 1-81.
4. M. S. BAZARAA AND H. D. SHERALI, On the use of exact and heuristic cutting plane methods for the quadratic assignment problem, J. Oper. Res. Soc., 33 (1982), pp. 991-1003.
5. E. R. BARNES, An algorithm for partitioning the nodes of a graph, SIAM J. Alg. Discrete Methods, 3 (1982), pp. 541-550.
6. E. R. BARNES AND A. J. HOFFMAN, Partitioning, spectra, and linear programming, in Progress in Combinatorial Optimization, W. E. Pulleyblank, ed., Academic Press, New York, 1984, pp. 13-25.
7. E. R. BARNES, A. VANNELLI, AND J. Q. WALKER, A new heuristic for partitioning the nodes of a graph, SIAM J. Discrete Math., 1 (1988), pp. 299-305.
8. I. M. BOMZE, Block pivoting and shortcut strategies for detecting copositivity, Linear Algebra Appl., 248 (1996), pp. 161-184.
9. I. M. BOMZE, Global escape strategies for maximizing quadratic forms over a simplex, J. Global Optim , 11 (1997), pp. 325-338.
10. I. M. BOMZE AND G. DANNINGER, A global optimization algorithm for concave quadratic programming problems, SIAM J Optim., 3 (1993), pp. 826-842.
11. I. M. BOMZE AND G DANNINGER, A finite algorithm for solving general quadratic problems, J. Global Optim., 4 (1994), pp. 1-16.
12. J. M. BORWEIN, Necessary and sufficient conditions for quadratic minimality, Numer. Funct. Anal. Optim., 5 (1982), pp. 127-140.
13. T. N. BUI AND C. JONES, A heuristic for reducing fill-in in sparse matrix factorization, in Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, Vol. I, Norfolk, VA, March 22-24, 1993, R. F. Sincovec, D. E. Keyes, M. R. Leuze, L. R. Petzold, and D A. Reed, eds., SIAM, Philadelphia, 1993, pp. 445-452.
14. C.-K. CHENG AND Y.-C. A. WEI, An improved two-way partitioning algorithm with stable performance, IEEE Trans. Comput Aided Design. 10 (1991), pp. 1502-1511.
15. L. B. CONTESSE, Une caractérisation complète des minima locaux en programmation quadratique, Numer. Math., 34 (1980), pp. 315-332.
16. G. DANNINGER AND I. M. BOMZE, Using copositivity for global optimality criteria in concave quadratic programming problems, Math Programming, 62 (1993), pp. 575-580.
17. W. E. DONATH AND A. J HOFFMAN, Lower bounds for the partitioning of graphs, IBM J. Res. Develop., 17 (1973), pp. 420-425.
18. J. FALKNER, F. RENDL, AND H. WOLKOWICZ, A computational study of graph partitioning, Math. Programming, 66 (1994), pp. 211-240.
19. M. FIEDLER, Algebraic connectivity of graphs, Czechoslovak Math. J., 23 (1973), pp. 298-305.
20. L. E. GIBBONS, D. W. HEARN, P. M. PARDALOS, AND M. V RAMANA, Continuous characterizations of the maximum clique problem, Math. Oper. Res., 22 (1997), pp. 754-768.
21. J. R. GILBERT, G. L MILLER, AND S.-H. TENG, Geometric mesh partitioning: Implementation and experiments, SIAM J. Sci. Comput., 19 (1998), pp. 2091-2110.
22. M. X. GOEMANS AND D P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
23. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
24. W. W. HAGER, Analysis and implementation of a dual algorithm for constrained optimization, J. Optim Theory Appl., 79 (1993), pp. 427-462.
25. W. W. HAGER, Applied Numerical Linear Algebra, Prentice-Hall, Englewood Cliffs, NJ, 1988.
26. J. B. HIRIART-URRUTY, Refinements of necessary optimality conditions in nondifferentiable programming. I, Appl. Math. Optim., 5 (1979), pp. 63-82.
27. J. B. HIRIART-URRUTY, Refinements of necessary optimality conditions in nondifferentiable programming. II. Optimality and stability in mathematical programming, Math. Programming Stud., 19 (1982), pp. 120-139.
28. M. T. HEATH AND P. RAGHAVAN, A Cartesian parallel nested dissection algorithm, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 235-253.
29. B HENDRICKSON AND R. LELAND, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., 16 (1995), pp. 452-469.
30. B. HENDRICKSON AND R. LELAND, A Multilevel Algorithm for Partitioning Graphs, Technical Report SAND93-1301, Sandia National Laboratories, Albuquerque, NM, 1993.
31. B W. KERNIGHAN AND S. LIN, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J., 49 (1970), pp. 291-307.
32. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392.
33. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley, Chichester, 1990.
34. D. G. LUENBERGER, Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, 1984.
35. G. L. MILLER, S.-H. TENG, W. THURSTON, AND S. A. VAVASIS, Automatic mesh partitioning, in Graph Theory and Sparse Matrix Computations, J. Gilbert and J. Liu, eds., IMA Vol. Math. Appl. 56, Springer-Verlag, New York, 1993, pp. 57-84.
36. T. S. MOTZKIN AND E. G. STRAUSS, Maxima for graphs and a new proof of a theorem of Turan, Canad. J. Math., 17 (1965), pp. 533-540.
37. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and linear programming, Math. Programming, 39 (1987), pp. 117-129.
38. P. M. PARDALOS AND J. B. ROSEN, Constrained Global Optimization: Algorithms and Applications, Springer-Verlag, Berlin, 1987.
39. P. M. PARDALOS AND S. A VAVASIS, Quadratic programming with one negative eigenvalue is NP-hard, J. Global Optim., 1 (1991), pp. 15-22.
40. A. POTHEN, H. D. SIMON, AND K.-P. LIOU, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
41. F. RENDL AND H. WOLKOWICZ, A projection technique for partitioning the nodes of a graph, Ann. Oper. Res., 58 (1995), pp. 172-191.
42. I. ROSENBERG, 0-1 optimization and nonlinear programming, Rev. Française Automat. Informat. Recherche Opérationelle, 6 (1972), pp. 95-97.
43. F. TARDELLA, On the equivalence between some discrete and continuous optimization problems, Ann. Oper. Res., 25 (1990), pp 291-300.
44. S.-H. TENG, Provably good partitioning and load balancing algorithms for parallel adaptive N-body simulation, SIAM J. Sci. Comput., 19 (1998), pp. 635-656.
45. H. WOLKOWICZ AND Q. ZHAO, Semidefinite programming relaxations for the graph partitioning problem, Discrete Appl. Math., to appear.