Parameterized Algorithms for Graph Partitioning Problems

We study a broad class of graph partitioning problems. Each problem is defined by two constants, α1 and α2. The input is a graph G, an integer k and a number p, and the objective is to find a subset U⊆V$U\subseteq V$ of size k, such that α1m1 + α2m2 is at most (or at least) p, where m1, m2 are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in U, respectively. This class of fixed-cardinality graph partitioning problems (FGPPs) encompasses Max (k, n − k)-Cut, Mink-Vertex Cover, k-Densest Subgraph, and k-Sparsest Subgraph. Our main result is a 4k + o(k)Δk⋅nO(1) time algorithm for any problem in this class, where Δ ≥ 1 is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. (Proc. International Symposium on Parameterized and Exact Computation, 2013). We obtain faster algorithms for certain subclasses of FGPPs, parameterized by p, or by (k + p). In particular, we give a 4p + o(p)⋅nO(1) time algorithm for Max (k, n − k)-Cut, thus improving significantly the best known pp⋅nO(1) time algorithm by Bonnet et al.

[1]  Michal Pilipczuk,et al.  Designing FPT Algorithms for Cut Problems Using Randomized Contractions , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[2]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[3]  Fahad Panolan,et al.  Representative Sets of Product Families , 2014, ESA.

[4]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[5]  Leizhen Cai,et al.  Parameterized Complexity of Cardinality Constrained Optimization Problems , 2008, Comput. J..

[6]  Leizhen Cai,et al.  Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems , 2006, IWPEC.

[7]  Michael R. Fellows,et al.  Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.

[8]  Hadas Shachnai,et al.  Faster Computation of Representative Families for Uniform Matroids with Applications , 2014, ArXiv.

[9]  Meirav Zehavi.  Deterministic Parameterized Algorithms for Matching and Packing Problems , 2013, ArXiv.

[10]  Fedor V. Fomin,et al.  Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms , 2013, SODA.

[11]  Fahad Panolan,et al.  Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets , 2015, SIAM J. Discret. Math..

[12]  Rolf Niedermeier,et al.  Parameterized Complexity of Vertex Cover Variants , 2007, Theory of Computing Systems.

[13]  Vangelis Th. Paschos,et al.  Exact and Approximation Algorithms for Densest k-Subgraph , 2013, WALCOM.

[14]  Xumin Liu,et al.  Low-Rank Matrix Factorization and Co-clustering Algorithms for Analyzing Large Data Sets , 2010, ICDEM.

[15]  Vangelis Th. Paschos,et al.  Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization , 2014, Algorithmica.

[16]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[17]  Vangelis Th. Paschos,et al.  Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization , 2013, IPEC.

[18]  Christian Komusiewicz,et al.  Finding Dense Subgraphs of Sparse Graphs , 2012, IPEC.

[19]  Hadas Shachnai,et al.  Representative Families: A Unified Tradeoff-Based Approach , 2014, ESA.

[20]  Saket Saurabh,et al.  (k, n-k)-Max-Cut: An 𝒪∗(2p)-Time Algorithm and a Polynomial Kernel , 2016, LATIN.

[21]  Pavel Berkhin,et al.  A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.

[22]  Nadine Gottschalk,et al.  Vlsi Physical Design From Graph Partitioning To Timing Closure , 2016 .

[23]  Joachim Kneis,et al.  Improved Upper Bounds for Partial Vertex Cover , 2008, WG.

[24]  Michal Pilipczuk,et al.  Minimum bisection is fixed parameter tractable , 2013, STOC.