Approximating the 2-catalog segmentation problem using semidefinite programming relaxations

Optimization Methods and Software

Volumn 18, Issue 6 I, 2003, Pages 705-719

  Xu, Dachuan ^a   Ye, Yinyu ^b   Zhang, Jiawei ^b  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

^b Stanford University   (United States)

Author keywords

Approximation algorithm; Catalog segmentation problem; Semidefinite programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; DATA MINING; GRAPH THEORY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION ALGORITHMS; CATALOG SEGMENTATION PROBLEM; GRAPH PARTITIONING; SEMIDEFINITE PROGRAMMING;

PROBLEM SOLVING;

EID: 0347316725     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780310001634082     Document Type: Conference Paper

References (15)

1. J. Kleinberg, C. Papadimitriou and P. Raghavan (1998). Segmentation problems. In Proceedings of the 30th Symposium on Theory of Computation, pp. 473-482.
2. U. Feige (2002). Relations between average case complexity and approximation complexity. In Proceedings on 34th Annual ACM Symposium on Theory and Computing, pp. 534-543.
3. Y. Doids, V. Guruswami and S. Khanna (1999). The 2-catalog segmentation problem. In Proceedings of SODA, pp. 378-380.
4. M.X. Goemans and D.P. Williamson (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1115-1145.
5. A. Frieze and M. Jerrum (1997). Improved approximation algorithms for max k-cut and max bisection. Algorithmica, 18, 67-81.
6. Y. Ye (2001). A .699-approximation algorithm for max-bisection. Mathematical Programming, 90, 101-111.
7. E. Halperin and U. Zwick (2001). A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. In IPCO, Lecture Notes in Computer Science. Springer, Berlin.
8. U. Fiege and M. Langberg (2001). Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms, 41, 174-211.
9. G. Andersson, L. Engebretsen and J. Håstad (2001). A new way to use semidefinite programming with applications to linear equations mod p. Journal of Algorithms, 39, 162-204.
10. U. Zwick (1999). Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proceedings of the 31st Symposium on Theory of Computation, pp. 679-687.
11. Y. Nesterov (1998). Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9, 141-160.
12. Q. Han, Y. Ye and J. Zhang (2002). An improved rounding method and semidefinite programming relaxation for graph partition. Mathematical Programming, 92, 509-535.
13. 2 rounding technique for semidefinte programs. In ICALP, Lecture Notes in Computer Science. Springer, Berlin.
14. U. Feige and M.X. Goemans (1995). Approximating the value of two prover proof systems, with applications to max 2sat and max dicut. In Proceedings of the 3rd Israel Symposium on Theory and Computing Systems, pp. 182-189.
15. Y. Ye and J. Zhang (2003). Approximation for dense-n/2-subgraph and the complement of min-bisection. Journal of Global Optimization, 25, 55-73.