On Multiway Cut parameterized above lower bounds
classification
💻 cs.DS
keywords
abovemultiwayboundslowermaximumnodealgorithmalgorithms
pith:IUP6FZMR Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{IUP6FZMR}
Prints a linked pith:IUP6FZMR badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.