A copositive programming approach to graph partitioning

SIAM Journal on Optimization

Volumn 18, Issue 1, 2007, Pages 223-241

  Povh, Janez ^a   Rendl, Franz ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Bandwidth problem; Copositive programming; Graph partitioning problem; Semidefinite programming; Vertex separator problem

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION;

BANDWIDTH PROBLEMS; COPOSITIVE PROGRAMMING; GRAPH PARTITIONING PROBLEMS; SEMIDEFINITE PROGRAMMING; VERTEX SEPARATOR PROBLEMS;

PROBLEM SOLVING;

EID: 39449117440     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/050637467     Document Type: Article

References (19)

1. C. J. ALPERT AND A. B. KAHNG, Recent directions in netlist partition: A survey, Integration, the VLSI Journal, 19 (1995), pp. 1-81.
2. K. ANSTREICHER AND H. WOLKOWICZ, On Lagrangian relaxation of quadratic matrix constraints, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 41-55.
3. G. BLACHE, M. KARPINSKI, AND W. JÜRGEN, On approximation intractability of the bandwidth problem, in Electronic Colloquium on Computation Complexity, University of Trier, Trier, Germany, 1998, TR98-014.
4. F. R. K. CHUNG, Labelings of graphs, in Selected Topics in Graph Theory 3, Academic Press, San Diego, 1988, pp. 151-168.
5. J. DÍAZ, J. PETIT, AND M. SERNA, A survey on graph layout problems, ACM Comput. Surveys, 34 (2002), pp. 313-356.
6. U. FEIGE, M. HAJIAGHAYI, AND J. R. LEE, Improved approximation algorithms for minimumweight vertex separators, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), Baltimore, MD, 2005, pp. 563-572.
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
8. S. GUATTERY AND G. L. MILLER, On the quality of spectral separators, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 701-719.
9. A. J. HOFFMAN AND H. W. WIELANDT, The variation of the spectrum of a normal matrix, Duke Math. J., 20 (1953), pp. 37-39.
10. C. HELMBERG, F. RENDL, B. MOHAR, AND S. POLJAK, A spectral approach to bandwidth and separator problems in graphs, Linear and Multilinear Algebra, 39 (1995), pp. 73-90.
11. E. DE KLERK AND D. V. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
12. Y.-L. LAI AND K. WILLIAMS, A survey of solved problems and applications on bandwidth, edgesum and profiles of graphs, J. Graph Theory, 31 (1999), pp. 75-94.
13. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, UK, 1990.
14. K. G. MURTY AND S. N. KABADI, Some NP-complete problems in quadratic and nonlinear programming, Math. Programming, 39 (1987), pp. 117-129.
15. P. A. PARRILO, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 2000.
16. J. POVH, Application of Semidefinite and Copositive Programming in Combinatorial Optimization, Ph.D. thesis, University of Ljubljana, Ljubljana, Slovenia, 2006.
17. F. RENDL AND H. WOLKOWICZ, A projection technique for partitioning the nodes of a graph, Ann. Oper. Res., 58 (1995), pp. 155-179.
18. C. DE SOUSA AND E. BALAS, The vertex separator problem, algorithms and computations, Math. Program., 103 (2005), pp. 609-631.
19. H. WOLKOWICZ AND Q. ZHAO, Semidefinite programming relaxations for the graph partitioning problem, Discrete Appl. Math., 96-97 (1999), pp. 461-479.