See this document in CiteSeerX!

Efficient Approximation Algorithms for Some Semidefinite Programs (1996)  (Make Corrections)  
Hsueh-I Lu



  Home/Search   Context   Related

 
View or download:
brown.edu/pub/techreport...cs9633.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ization problems. Nonlinear programming did not receive as much attention in this respect until the recent work by Goemans and Williamson [62]. They use semidefinite programs, which are nonlinear programs, to obtain approximation solutions with much better approximation factors. For example, the best previously known approximation algorithm for MAXCUT, which was invented twenty years ago, has approximation factor 0.5 [137]. The algorithm of Goemans and Williamson dramatically improves the... (Update)

Similar documents (at the sentence level):
7.2%:   Efficient Approximation Algorithms for Semidefinite Programs.. - Klein, Lu (1996)   (Correct)
6.7%:   Space-efficient Approximation Algorithms for MAXCUT and COLORING .. - Klein, Lu (1996)   (Correct)

Active bibliography (related documents):   More   All
0.9:   Improved Approximation Algorithms for Maximum Cut and.. - Goemans, Williamson (1995)   (Correct)
0.8:   Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)   (Correct)
0.8:   The Maximum Clique Problem - Bomze, Budinich, Pardalos, Pelillo (1999)   (Correct)

Similar documents based on text:   More   All
0.7:   Semidefinite Programming and Integer Programming - Laurent, Rendl   (Correct)
0.6:   Fault-Tolerant and Efficient Parallel Computation - Shvartsman (1992)   (Correct)
0.5:   Approximation Algorithm for the Max-Cut Problem - Gosti, Nguyen, Wan, Zhou   (Correct)

BibTeX entry:   (Update)

@techreport{ lu96efficient,
    author = "Hsueh-I Lu",
    title = "Efficient Approximation Algorithms for Some Semidefinite Programs",
    number = "CS-96-33",
    year = "1996",
    url = "citeseer.ist.psu.edu/article/lu96efficient.html" }
Citations (may not include all citations):
4212   Computers and Intractability---A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
2441   The Johns Hopkins University Press (context) - Holub, Van Loan - 1989
2003   The Art of Computer Programming (context) - Knuth - 1973
773   Reducibility among combinatorial problems (context) - Karp - 1972
717   Theory of Linear and Integer Programming (context) - Schrijver - 1986
708   Cambridge University Press (context) - Horn, Johnson - 1985
640   Princeton University Press (context) - Rockafellar - 1970
529   Linear matrix Inequalities in System and Control Theory (context) - Boyd, Ghaoui et al. - 1994
525   Iterative Methods for Sparse Linear Systems (context) - Saad - 1996
448   A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
415   Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
403   Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
333   Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
307   Interior Point Polynomial Methods in Convex Programming: The.. (context) - Nesterov, Nemirovskii - 1994
300   the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
300   the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
293   Approximation algorithms for combinatorial problems (context) - Johnson - 1974
276   Semidefinite programming - Vandenberghe, Boyd - 1996
230   Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
225   Some simplified NPcomplete graph problems (context) - Garey, Johnson et al. - 1976
219   and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
218   Probabilistic construction of deterministic algorithms appro.. (context) - Raghavan - 1988
216   Register allocation and spilling via graph coloring (context) - Chaitin - 1982
201   Register allocation via coloring (context) - Chaitin, Auslander et al. - 1981
196   Linear Algebra and Its Applications (context) - Strang - 1980
186   Randomized rounding: A technique for provably good algorithm.. (context) - Raghavan, Thompson - 1987
173   An interiorpoint method for semidefinite programming - Helmberg, Rendl et al. - 1996
171   The Theory of Matrices (context) - Lancaster, Tismenetsky - 1985
154   Fast approximation algorithms for fractional packing and cov.. - Plotkin, Shmoys et al. - 1991
154   Fast approximation algorithms for fractional packing and cov.. - Plotkin, Shmoys et al.
151   Every planar map is four colorable (context) - Appel, Haken et al. - 1977
151   Every planar map is four colorable (context) - Appel, Haken - 1977
149   Polynomial time approximation schemes for dense instances of.. - Arora, Karger et al.
129   A polynomial algorithm in linear programming (context) - Khachiyan - 1979
127   Lanczos Algorithms for Large Symmetric Eigenvalue Computatio.. (context) - Cullum, Willoughby - 1985
124   TSPLIB --- A traveling salesman problem library (context) - Reinelt - 1991
117   The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1981
115   Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
115   PCPs and nonapproximability ---towards tight results (context) - Bellare, Goldreich et al.
112   Improved approximation algorithms for MAX k- CUT and MAX BIS.. - Frieze, Jerrum
112   The priority-based coloring approach to register allocation (context) - Chow, Hennessy - 1990
112   Improved approximation algorithms for MAX k- CUT and MAX BIS.. - Frieze, Jerrum - 1996
108   Iterative Solution of Large Sparse Systems of Equations (context) - Hackbusch - 1994
108   Improved non-approximability results - Bellare, Sudan
108   Coloring heuristics for register allocation (context) - Briggs, Cooper et al. - 1989
107   complete approximation problems (context) - Sahni, Gonzalez - 1976
106   approximation algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson
103   Fast approximation algorithms for multicommodity flow proble.. - Leighton, Makedon et al. - 1991
99   Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
90   A primal-dual potential reduction method for problems involv.. - Vandenberghe, Boyd - 1995
85   The maximum concurrent flow problem (context) - Shahrokhi, Matula - 1990
81   Improvements to graph coloring register allocation - Briggs, Cooper et al. - 1994
75   Approximation algorithms for the set covering and vertex cov.. (context) - Hochbaum - 1982
75   Linear Programming and Network Flows (context) - Bazaraa, Jarvis et al. - 1990
69   Faster approximation algorithms for the unit capacity concur.. - Klein, Plotkin et al. - 1994
67   A new algorithm for minimizing convex functions over convex .. (context) - Vaidya
63   Linear Programming (context) - Chv'atal - 1983
62   the hardness of approximating the chromatic number - Khanna, Linial et al. - 1992
60   IEEE Transactions on Information Theory (context) - Lov'asz, Shannon et al. - 1979
52   Eigenvalues of Matrices (context) - Chatelin - 1993
49   Interior--point methods for the monotone linear complementar.. (context) - Kojima, Shindoh et al. - 1994
49   An interior-point method for minimizing the maximum eigenval.. (context) - Jarre - 1993
48   The zero-error capacity of a noisy channel (context) - Shannon - 1956
48   Self-Concordant Functions and Polynomial Time Methods in Cov.. (context) - Nesterov, Nemirovskii - 1989
47   Speeding-up linear programming using fast matrix multiplicat.. (context) - Vaidya
46   the facial structure of set packing polyhedra (context) - Padberg - 1973
42   Edmonds polytopes and a hierarchy of combinatorial problems (context) - Chv'atal - 1973
42   Interior Point Approach to Linear (context) - den Hertog - 1994
41   Adding multiple cost constraints to combinatorial optimizati.. - Karger, Plotkin
41   the computational complexity of Ising spin glass models (context) - Barahona - 1982
40   Randomized rounding without solving the linear program - Young - 1995
38   and maximum independent set of a chordal graph (context) - Gavril, minimum et al. - 1972
38   Fast approximation schemes for convex programs with many blo.. (context) - Grigoriadis, Khachiyan - 1991
38   A still better performance guarantee for approximate graph c.. (context) - Halld'orsson - 1993
38   Algorithms for edge coloring bipartite graphs and multigraph.. (context) - Gabow, Kariv - 1982
36   Finding a maximum cut of a planar graph in polynomial time (context) - Hadlock - 1975
36   Derandomizing semidefinite programming based approximation a.. (context) - Mahajan, Ramesh
36   An application of combinatorial optimization to statistical .. (context) - Barahona, Grotschel et al. - 1988
35   Polynomial algorithms for perfect graphs (context) - Grotschel, Lov'asz et al. - 1984
35   Node- and edge-deletion NP-complete problems (context) - Yannakakis - 1978
34   Improving the performance guarantee for approximate graph co.. (context) - Wigderson - 1983
34   An introduction to the Conjugate Gradient Method without the.. (context) - Shewchuk - 1994
34   A Survey of Preconditioned Iterative Methods (context) - Bruaset - 1995
33   An application of graph coloring to printed circuit testing (context) - Garey, Johnson et al. - 1975
32   An algorithm for integer solutions to linear programs (context) - Gomory - 1963
30   Semi-definite matrix constraints in optimization (context) - Fletcher - 1985
28   A geometric approach to betweenness - Chor, Sudan - 1995
28   How good is the Goemans-Williamson MAX CUT algorithm (context) - Karloff
27   SP: Software for semidefinite programming (context) - Vandenberghe, Boyd - 1994
26   potential reduction algorithm for linear programming (context) - Ye - 1991
25   Complexity of an algorithm for finding an approximate soluti.. (context) - Freund - 1994
24   Bounds on positive integral solutions of linear Diophantine .. (context) - Borosh, Treybig - 1976
23   New approximation algorithms for graph coloring - Blum - 1994
22   Connections between semidefinite relaxations of the max-cut .. - Laurent, Poljak et al. - 1995
22   Stable sets and polynomials (context) - Lov'asz
21   Cones of Matrices and Setfunctions (context) - Lov'asz, Schrijver - 1991
21   The Max Cut problem in graphs not contractible to K (context) - Barahona - 1983
20   An Introduction to Convex Polytopes (context) - Brndsted - 1983
18   The Lov'asz theta function and a semidefinite programming re.. - Kleinberg, Goemans
17   The Electronic Journal of Combinatorics (context) - Knuth, theorem - 1994
16   Efficient algorithms for layer assignment problems (context) - Chang, Du - 1987
16   Some tools for approximate 3-coloring (context) - Blum - 1990
16   Optimal layer assignment for interconnect (context) - Pinter - 1984
15   Finding the maximal cut in a graph (context) - Orlova, Dorfman - 1972
15   Maximization of a linear function of variables subject to li.. (context) - Dantzig - 1951
14   Problems of distance geometry and convex properties of quadr.. (context) - Barvinok - 1995
14   Leighton-Rao might be practical: Faster approximation algori.. (context) - Klein, Stein et al. - 1990
13   A technique for coloring a graph applicable to large-scale o.. (context) - Wood - 1969
13   Wiley-Interscience series in discrete mathematics and optimi.. (context) - Jensen, Toft et al. - 1995
13   A graph-theoretic via minimization algorithm for two-layer p.. (context) - Chen, Kajitani et al. - 1983
12   and improved approximation algorithm for k-coloring (context) - Blum, -approximation et al. - 1989
11   Every planar graph is four colorable (context) - Appel, Haken - 1989
11   Cone-LP's and semidefinite programs: Geometry and a simplex-.. - Pataki - 1996
11   A primal-dual interior-point method for the max-min eigenval.. (context) - Rendl, Vanderbei et al. - 1993
11   MAXCUT has a randomized approximation scheme in dense graphs (context) - Vega - 1994
10   Minimum weighted coloring of triangulated graphs (context) - Balas, Xue - 1991
10   Approximation and intractability results for the maximum cut.. (context) - Haglin, Venkatesan - 1991
10   Weakly bipartite graphs and the max-cut problem (context) - Grotschel, Pulleyblank - 1981
10   On cone-LP's and semi-definite programs: Facial structure (context) - Pataki - 1995
9   the facial structure of cone-LP's and semi-definite programs (context) - Pataki - 1994
9   Sur une conjecture relative au probl`eme des codes optimaux (context) - Berge - 1962
8   Estimating the largest eigenvalue by the power and Lanczos a.. (context) - Kuczy'nski, Wo'zniakowski - 1992
8   solver for semidefinite programs with matrix structure (context) - Boyd, Wu et al. - 1996
8   Maximum cuts and largest bipartite subgraphs (context) - Poljak, Tuza - 1995
7   Iterative Methods for Linear and Nonlinear Equations (context) - Kelly - 1995
6   Efficient approximation algorithms for semidefinite programs.. - Klein, Lu
6   How well can a graph be n-colored (context) - Vit'anyi - 1981
6   Integer linear programs and local search for max-cut (context) - Poljak - 1995
6   A sublinear-time randomized parallel algorithm for the maxim.. - Alizadeh - 1991
6   A polynomial algorithm for constructing a large bipartite su.. (context) - Poljak, Turz'ik - 1982
5   Efficient register allocation via coloring using clique sepa.. (context) - Gupta, Soffa et al. - 1994
5   Exact ground states of Ising spin glasses: New experimental .. - Simone, Diehl et al. - 1995
5   Efficiently four-coloring planar graphs (context) - Robertson, Sanders et al.
4   Semidefinite Programming Algorithm) users manual (context) - Fujisawa, Kojima - 1995
4   approximation algorithms and randomization; A unified view o.. (context) - Bertsimas, Vohra et al. - 1994
4   a problem of Shannon (context) - Rosenfeld - 1967
3   A new approximate graph coloring algorithm (context) - Wigderson - 1982
3   Submitted to Information Processing Letters (context) - Blum, Karger et al. - 1996
3   An optimization method for convex programs---interiorpoint m.. (context) - Yoshise - 1994
3   Exact ground states of two-dimensional \SigmaJ Ising spin gl.. (context) - Simone, Diehl et al. - 1996
3   A highly parallel algorithm to approximate MaxCut on distrib.. (context) - Homer, Peinado - 1995
3   May--1 June (context) - the, ACM et al. - 1995
3   The critical exponents of the two-dimensional Ising spin gla.. (context) - Rieger, Santen et al.
2   On some applications of the Chinese Postman Problem (context) - Barahona - 1990
2   A Matlab toolbox for semidefinite programming (context) - Rendl - 1994
2   Multivariable Analysis (context) - Price - 1984
2   ungerade Kreise starr sind (context) - Berge, deren - 1961
2   Amsterdam and London (context) - Berge, Hypergraphs - 1973
2   The coloring and maximum independent set problems on planar .. (context) - Hsu - 1988
2   Approximating the independence number via the `-fucntion (context) - Alon, Kahale - 1994
2   TSPLIB --- A library of travelling salesman and related prob.. (context) - Bixby, Reinelt - 1992
1   Addendum: Minimum weighted coloring of triangulated graphs (context) - Balas, Xue - 1992
1   algorithm for coloring perfect planar graphs (context) - Tucker, Wilson - 1984
1   Space-efficient approximation algorithms for MAXCUT and COLO.. - Klein, Lu - 1996

Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index):   More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998)   (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992)   (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning..   (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