Rounding algorithms for a geometric embedding of minimum multiway cut

DOI10.1145/301250.301430MaRDI QIDQ6828786zbMATH OpenFDO

Authors David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Connectivity (05C40)

Cited in

(1)

• Monotone submodular multiway partition

This page was built for publication: Rounding algorithms for a geometric embedding of minimum multiway cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828786)