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*(4k) algorithms for Vertex Cover above Maximum Matching and Almost 2-SAT as well as an O*(2k) algorithm for Node Multiway Cut with a standard parameterization by the solution size, improving previous bounds for these problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.