Parameterized and Exact Computation
Volume 7112 of the series Lecture Notes in Computer Science pp 1-12
On Multiway Cut Parameterized above Lower Bounds
- Marek CyganAffiliated withInstitute of Informatics, University of Warsaw
- , Marcin PilipczukAffiliated withInstitute of Informatics, University of Warsaw
- , Michał PilipczukAffiliated withInstitute of Informatics, University of Warsaw
- , Jakub Onufry WojtaszczykAffiliated withGoogle Inc.
Abstract
In this paper we consider two above lower bound parameterizations of the Node Multiway Cut problem — above the maximum separating cut and above a natural LP-relaxation — and prove them to be fixed-parameter tractable. Our results imply O *(4 k ) algorithms for Vertex Cover above Maximum Matching and Almost 2-SAT as well as an O *(2 k ) algorithm for Node Multiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems.
- Title
- On Multiway Cut Parameterized above Lower Bounds
- Book Title
- Parameterized and Exact Computation
- Book Subtitle
- 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers
- Pages
- pp 1-12
- Copyright
- 2012
- DOI
- 10.1007/978-3-642-28050-4_1
- Print ISBN
- 978-3-642-28049-8
- Online ISBN
- 978-3-642-28050-4
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- 7112
- Series ISSN
- 0302-9743
- Publisher
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Topics
- Industry Sectors
- eBook Packages
- Editors
-
- Dániel Marx (16)
- Peter Rossmanith (17)
- Editor Affiliations
-
- 16. MTA SZTAKI
- 17. Lehrgebiet Theoretische Informatik, RWTH Aachen
- Authors
-
- Marek Cygan (18)
- Marcin Pilipczuk (18)
- Michał Pilipczuk (18)
- Jakub Onufry Wojtaszczyk (19)
- Author Affiliations
-
- 18. Institute of Informatics, University of Warsaw, Poland
- 19. Google Inc., Cracow, Poland
Continue reading...
To view the rest of this content please follow the download PDF link above.