Bisections above tight lower bounds

Authors:
Matthias Mnich;Rico Zenklusen
Affiliations:
Cluster of Excellence, Saarbrücken, Germany;Massachusetts Institute of Technology, Cambridge, MA
Venue:
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Year:
2012

Citing 9
Cited 1

Approximation and Intractability Results for the Maximum Cut Problem and Its Variants

IEEE Transactions on Computers
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Note on maximal bisection above tight lower bound

Information Processing Letters
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Journal of Computer and System Sciences
Solving MAX-r-SAT Above a Tight Lower Bound

Algorithmica
Constraint satisfaction problems parameterized above or below tight bounds: a survey

The Multivariate Algorithmic Revolution and Beyond
Max-cut parameterized above the edwards-erdős bound

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity

Parameterized Complexity

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most one, and the size of the bisection is the number of edges which go across the two parts. Every graph with m edges has a bisection of size at least ⌈m/2 ⌉, and this bound is sharp for infinitely many graphs. Therefore, Gutin and Yeo considered the parameterized complexity of deciding whether an input graph with m edges has a bisection of size at least ⌈m/2 ⌉+k, where k is the parameter. They showed fixed-parameter tractability of this problem, and gave a kernel with O(k2) vertices. Here, we improve the kernel size to O(k) vertices. Under the Exponential Time Hypothesis, this result is best possible up to constant factors.