The real positive semidefinite completion problem for series-parallel graphs

Linear Algebra and Its Applications

Volumn 252, Issue 1-3, 1997, Pages 347-366

  Laurent, Monique ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039506352     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(95)00741-5     Document Type: Article

References (25)

1. F. Barahona, On cuts and matchings in planar graphs, Math. Programming 60:53-68 (1993).
2. F. Barahona and A. R. Mahjoub, On the cut polytope, Math. Programming 36:157-173 (1986).
3. W. W. Barrett, C. R. Johnson, and P. Tarazaga, The real positive definite completion problem for a simple cycle, Linear Algebra Appl. 192:3-31 (1993).
4. W. W. Barrett, C. R. Johnson, and R. Loewy, The real positive definite completion problem: Cycle completability, Memoirs of the Amer. Math. Soc. to appear.
5. M. Berger, Geometry II, Springer-Verlag, 1987.
6. J. P. R. Christensen and J. Vesterstrøm, A note on extreme positive definite matrices, Math. Ann. 244:65-68 (1979).
7. M. Deza and M. Laurent, Facets for the cut cone I, Math. Programming 56(2):121-160 (1992).
8. M. Deza and M. Laurent, Facets for the cut cone II: Clique-web facets, Math. Programming 56(2):161-188 (1992).
9. R. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl. 10:303-318, (1965).
10. M. Fiedler, Matrix inequalities, Numer. Math. 9:109-119 (1966).
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. Michel X. Goemans and David P. Williamson, .878-approximation algorithms for MAX CUT and MAX 2SAT, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montréal, 1994, pp. 422-431.
13. n for n = 7 are known, European J. Combin. 11:115-117 (1990).
14. R. Grone, C. R. Johnson, E. M. Sá, and H. Wolkowicz, Positive definite completions of partial hermitian matrices, Linear Algebra Appl. 58:109-124 (1984).
15. R. Grone, S. Pierce, and W. Watkins, Extremal correlation matrices, Linear Algebra Appl 134:63-70 (1990).
16. C. R. Johnson, Matrix completion problems: A survey, in Proc. Symp. Appl. Math. 40, Amer. Math. Soc., Providence, pp. 171-198 (1990).
17. C. R. Johnson and T. A. McKee, Structural conditions for cycle completable graphs, Preprint.
18. M. Laurent and S. Poljak, One-third-integrality in the max-cut problem, Math. Programming 71:29-50 (1995).
19. M. Laurent and S. Poljak, On a positive semidefinite relaxation of the cut polytope, Linear Algebra Appl. 223/224:439-461 (1995).
20. M. Laurent and S. Poljak, On the Facial Structure of the Set of Correlation Matrices, Report BS-R9501, Centrum voor Wiskunde en Informatica, Amsterdam, 1995; SIAM J. Matrix Anal. Appl., to appear.
21. M. Laurent, S. Poljak, and F. Rendl, Connections between Semidefinite Relaxations of the Max-Cut and Stable Set Problems, Report BS-R9502, Centrum voor Wiskunde en Informatica, Amsterdam, 1995; Math. Programming, to appear.
22. Chi-Kwong Li and Bit-Shun Tam, A note on extreme correlation matrix, SIAM J. Matrix Anal. Appl. 15(3):903-908 (1994).
23. R. Loewy, Extreme points of a convex subset of the cone of positive semidefinite matrices, Math. Ann. 253:227-232 (1980).
24. S. Poljak and F. Rendl, Nonpolyhedral relaxations of graph-bisection problems. SIAM J. Optim. 5:467-487 (1995).
25. S. Poljak and Z. Tuza, Maximum cuts and largest bipartite subgraphs, in (W. Cook, L. Lovász, and P. Seymour, Eds.), Combinatorial Optimization, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 20, Amer. Math. Soc., 1995, pp. 181-244.