Rounding algorithms for a geometric embedding of minimum multiway cut
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 668-678
- https://doi.org/10.1145/301250.301430
Abstract
No abstract availableAll Related Versions
This publication has 7 references indexed in Scilit:
- The geometry of graphs and some of its algorithmic applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal 3-Terminal Cuts and Linear ProgrammingPublished by Springer Nature ,1999
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation AlgorithmSIAM Journal on Computing, 1998
- An improved approximation algorithm for multiway cutPublished by Association for Computing Machinery (ACM) ,1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988