The 2-catalog segmentation problem

Authors:
Yevgeniy Dodis;Venkatesan Guruswami;Sanjeev Khanna
Affiliations:
MIT Lab for Computer Science, 545 Technology Square, Cambridge, MA;MIT Lab for Computer Science, 545 Technology Square, Cambridge, MA;Department of Fundamental Mathematics Research, Bell Labs, 700 Mountain Avenue, Murray Hill, NJ
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 2
Cited 3

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Segmentation problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Relations between average case complexity and approximation complexity

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Catalog segmentation with double constraints in business

Pattern Recognition Letters
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract