Abstract
We introduce nonlinear formulations for the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. Through these formulations we establish a connection between the multiway cut and the maximum weighted independent set problem that leads to the study of the tightness of several LP formulations for the multiway cut problem through the theory of perfect graphs. We finally introduce a new randomized rounding heuristic to study the worst case bound of these formulations, obtaining a new bound of 2α(H)(1-1/k) for the multicut problem, where α(H) is the size of a maximum independent set in the demand graph H.
Research partially supported by a Presidential Young Investigator Award DDM-9158118 with matching funds from Draper Laboratory.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Berge and V. Chvátal (eds), Topics on Perfect graphs, Annals of Discrete Mathematics, 21, 1984.
S. Chopra and L.H. Owen, Extended formulations for the A-cut problem, preprint, 1994.
S. Chopra and M.R. Rao, On the multiway cut polyhedron, Networks, 21, 51–89, 1991.
W.H. Cunningham, The optimal multiterminal cut problem, DIMACS series in Discrete Mathematics and Theoretical Computer Science, 5, 105–120, 1991.
E. Dalhaus, D. Johnson, C. Papadimitriou, P. Seymour and M. Yannakakis, The complexity of the multiway cuts, 24th Annual ACM STOC, 241–251, 1992.
P. Erdos and L.A. Székely, On weighted multiway cuts in trees, Mathematical Programming, 65, 93–105, 1994.
N. Garg, V. Vazirani, M. Yannakakis, Approximate max-flow min-(multi) cut theorems and their applications, 26th Annual ACM STOC, 1994.
M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, 1988.
L. Lovász and A. Schrijver, Cones of Matrices and Set-Functions and 0–1 Optimization, SIAM J. Optimization, 1, 166–190, 1991.
M. Laurent and S. Poljak, On the facial structure of the set of correlation matrices, Technical report, 1994.
M. Padberg, The Boolean quadric polytope: some characteristics, facets and relatives, Mathematical Programming, 45, 139–172, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertsimas, D., Teo, C., Vohra, R. (1995). Nonlinear formulations and improved randomized approximation algorithms for multicut problems. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_39
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive