On Multiway Cut parameterized above lower bounds
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2011
- DOI:
- 10.48550/arXiv.1107.1585
- arXiv:
- arXiv:1107.1585
- Bibcode:
- 2011arXiv1107.1585C
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- F.2.2