34 research outputs found
Polynomial Kernels for {\lambda}-extendible Properties Parameterized Above the Poljak-Turz\'ik Bound
Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of
{\lambda}-extendible properties of graphs as a generalization of the property
of being bipartite. They showed that for any 0 < {\lambda} < 1 and
{\lambda}-extendible property {\Pi}, any connected graph G on n vertices and m
edges contains a spanning subgraph H in {\Pi} with at least {\lambda}m +
(1-{\lambda})(n-1)/2 edges. The property of being bipartite is
{\lambda}-extendible for {\lambda} = 1/2, and so the Poljak-Turzik bound
generalizes the well-known Edwards-Erdos bound for Max-Cut. Other examples of
{\lambda}-extendible properties include: being an acyclic oriented graph, a
balanced signed graph, or a q-colorable graph for some integer q.
Mnich et. al. (FSTTCS 2012) defined the closely related notion of strong
{\lambda}-extendibility. They showed that the problem of finding a subgraph
satisfying a given strongly {\lambda}-extendible property {\Pi} is
fixed-parameter tractable (FPT) when parameterized above the Poljak-Turzik
bound - does there exist a spanning subgraph H of a connected graph G such that
H in {\Pi} and H has at least {\lambda}m + (1-{\lambda})(n-1)/2 + k edges? -
subject to the condition that the problem is FPT on a certain simple class of
graphs called almost-forests of cliques.
In this paper we settle the kernelization complexity of nearly all problems
parameterized above Poljak-Turzik bounds, in the affirmative. We show that
these problems admit quadratic kernels (cubic when {\lambda} = 1/2), without
using the assumption that the problem is FPT on almost-forests of cliques. Thus
our results not only remove the technical condition of being FPT on
almost-forests of cliques from previous results, but also unify and extend
previously known kernelization results in this direction. Our results add to
the select list of generic kernelization results known in the literature
Beyond Max-Cut: \lambda-Extendible Properties Parameterized Above the Poljak-Turz\'{i}k Bound
Poljak and Turz\'ik (Discrete Math. 1986) introduced the notion of
\lambda-extendible properties of graphs as a generalization of the property of
being bipartite. They showed that for any 0<\lambda<1 and \lambda-extendible
property \Pi, any connected graph G on n vertices and m edges contains a
subgraph H \in {\Pi} with at least \lambda m+ (1-\lambda)/2 (n-1) edges. The
property of being bipartite is 1/2-extendible, and thus this bound generalizes
the Edwards-Erd\H{o}s bound for Max-Cut.
We define a variant, namely strong \lambda-extendibility, to which the bound
applies. For a strongly \lambda-extendible graph property \Pi, we define the
parameterized Above Poljak- Turz\'ik (APT) (\Pi) problem as follows: Given a
connected graph G on n vertices and m edges and an integer parameter k, does
there exist a spanning subgraph H of G such that H \in {\Pi} and H has at least
\lambda m + (1-\lambda)/2 (n - 1) + k edges? The parameter is k, the surplus
over the number of edges guaranteed by the Poljak-Turz\'ik bound.
We consider properties {\Pi} for which APT (\Pi) is fixed- parameter
tractable (FPT) on graphs which are O(k) vertices away from being a graph in
which each block is a clique. We show that for all such properties, APT (\Pi)
is FPT for all 0<\lambda<1. Our results hold for properties of oriented graphs
and graphs with edge labels. Our results generalize the result of Crowston et
al. (ICALP 2012) on Max-Cut parameterized above the Edwards-Erd\H{o}s bound,
and yield FPT algorithms for several graph problems parameterized above lower
bounds, e.g., Max q-Colorable Subgraph problem. Our results also imply that the
parameterized above-guarantee Oriented Max Acyclic Digraph problem is FPT, thus
solving an open question of Raman and Saurabh (Theor. Comput. Sci. 2006).Comment: 23 pages, no figur
{Polynomial Kernels for -extendible Properties Parameterized Above the {Poljak--Turz{\'{i}}k} Bound}
Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of {\lambda}-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < {\lambda} < 1 and {\lambda}-extendible property {\Pi}, any connected graph G on n vertices and m edges contains a spanning subgraph H in {\Pi} with at least {\lambda}m + (1-{\lambda})(n-1)/2 edges. The property of being bipartite is {\lambda}-extendible for {\lambda} = 1/2, and so the Poljak-Turzik bound generalizes the well-known Edwards-Erdos bound for Max-Cut. Other examples of {\lambda}-extendible properties include: being an acyclic oriented graph, a balanced signed graph, or a q-colorable graph for some integer q. Mnich et. al. (FSTTCS 2012) defined the closely related notion of strong {\lambda}-extendibility. They showed that the problem of finding a subgraph satisfying a given strongly {\lambda}-extendible property {\Pi} is fixed-parameter tractable (FPT) when parameterized above the Poljak-Turzik bound - does there exist a spanning subgraph H of a connected graph G such that H in {\Pi} and H has at least {\lambda}m + (1-{\lambda})(n-1)/2 + k edges? - subject to the condition that the problem is FPT on a certain simple class of graphs called almost-forests of cliques. In this paper we settle the kernelization complexity of nearly all problems parameterized above Poljak-Turzik bounds, in the affirmative. We show that these problems admit quadratic kernels (cubic when {\lambda} = 1/2), without using the assumption that the problem is FPT on almost-forests of cliques. Thus our results not only remove the technical condition of being FPT on almost-forests of cliques from previous results, but also unify and extend previously known kernelization results in this direction. Our results add to the select list of generic kernelization results known in the literature
MaxCut Above Guarantee
In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k?) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 2/3|E| lower bound in tripartite graphs
Balanced Judicious Bipartition is Fixed-Parameter Tractable
The family of judicious partitioning problems, introduced by Bollob\u27as and Scott to the field of extremal combinatorics, has been extensively studied from a structural point of view for over two decades. This rich realm of problems aims to counterbalance the objectives of classical partitioning problems such as Min Cut, Min Bisection and Max Cut. While these classical problems focus solely on the minimization/maximization of the number of edges crossing the cut, judicious (bi)partitioning problems ask the natural question of the minimization/maximization of the number of edges lying in the (two) sides of the cut. In particular, Judicious Bipartition (JB) seeks a bipartition that is "judicious" in the sense that neither side is burdened by too many edges, and Balanced JB also requires that the sizes of the sides themselves are "balanced" in the sense that neither of them is too large. Both of these problems were defined in the work by Bollob\u27as and Scott, and have received notable scientific attention since then. In this paper, we shed light on the study of judicious partitioning problems from the viewpoint of algorithm design. Specifically, we prove that BJB is FPT (which also proves that JB is FPT)
Hypergraph cuts above the average
An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2 + Ω(√m), and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is Ω(√m) larger than the expected size of a random r-cut. Moreover, in the case where k = 3 and r = 2 this bound is best possible and is attained by Steiner triple systems. Surprisingly, for all other cases (that is, if k ≥ 4 or r ≥ 3), we show that every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m^(5/9)) larger than the expected size of a random r-cut. This is a significant difference in behaviour, since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation
MaxCut Above Guarantee
In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k5) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 23 |E| lower bound in tripartite graphs