S. Poljak and F. Rendl. Solving the max-cut problem using eigenvalues. Report 91735-OR, Institute fur Diskrete Mathematik, University of Bonn, 1991. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Optimization via Enumeration: a new algorithm for the Max Cut .. - Galluccio, Loebl (2001) (Correct)
A new algorithm for the Ising problem - Galluccio, Loebl, al. (2000) (Correct)
A new algorithm for the MAX-CUT problem - Galluccio, Loebl, al. (1999) (Correct)
Interior Point Methods in Semidefinite Programming with.. - Alizadeh (1993) (223 citations) (Correct)
Searching Ground States in Ising Spin Glass Systems - Homer, Peinado (Correct)
A Randomized Approximation Scheme for Metric MAX-CUT - Vega, Kenyon (17 citations) (Correct)
Path Optimization for Graph Partitioning Problems - Berry, Goldberg (1998) (11 citations) (Correct)
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
Interior Point Methods In Semidefinite Programming With.. - Alizadeh (1995) (223 citations) (Correct)
Path Optimization for Graph Partitioning Problems - Berry, Goldberg (1995) (11 citations) (Correct)
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
Spectral Partitioning: The More Eigenvectors, The Better - Alpert, Kahng, Yao (1994) (19 citations) (Correct)
Applications of Cut Polyhedra - Deza, Laurent (1992) (11 citations) (Correct)
Relaxations of the Max Cut Problem and Computation of Spin.. - Jünger, Rinaldi (1997) (1 citation) (Correct)
Design and Performance of Parallel and Distributed.. - Homer, Peinado (1995) (17 citations) (Correct)
A Randomized Approximation Scheme for Metric MAX-CUT - Vega, Kenyon (2001) (17 citations) (Correct)
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995) (389 citations) (Correct)
Nonpolyhedral Relaxations of Graph-Bisection Problems - Poljak, Rendl (1993) (24 citations) Self-citation (Poljak Rendl) (Correct)
Semidefinite Programming and Combinatorial Optimization - Rendl (1998) (5 citations) Self-citation (Rendl) (Correct)
Solving Quadratic (0,1)-Problems by Semidefinite Programs and .. - Helmberg, Rendl (1995) Self-citation (Rendl) (Correct)
Node and Edge Relaxations of the Max-Cut Problem - Poljak, Rendl (1994) (3 citations) Self-citation (Rendl Poljak) (Correct)
Nonpolyhedral Relaxations of Graph-Bisection Problems - Poljak, Rendl (1992) (24 citations) Self-citation (Poljak Rendl) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC