Rounding algorithms for a geometric embedding of minimum multiway cut
DOI10.1145/301250.301430zbMath1345.90095arXivcs/0205051MaRDI QIDQ2819596
Mikkel Thorup, Neal E. Young, David R. Karger, Clifford Stein, Philip N. Klein
Publication date: 29 September 2016
Published in: Mathematics of Operations Research, Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0205051
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
90C59: Approximation methods and heuristics in mathematical programming
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
05C40: Connectivity
