On multiway cut parameterized above lower bounds

DOI10.1007/978-3-642-28050-4_1MaRDI QIDQ6828952zbMATH OpenFDO

Authors Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Jakub Onufry Wojtaszczyk

Publication date 15 June 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28050-4_1

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

This page was built for publication: On multiway cut parameterized above lower bounds

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