research-article

Clique Cover and Graph Separation: New Incompressibility Results

Authors:

Stefan Kratsch,

Marcin Pilipczuk,

Michał Pilipczuk,

Magnus WahlströmAuthors Info & Claims

ACM Transactions on Computation Theory (TOCT), Volume 6, Issue 2

Article No.: 6, Pages 1 - 19

https://doi.org/10.1145/2594439

Published: 01 May 2014 Publication History

Abstract

The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. In this article, we show that, unless the polynomial hierarchy collapses to its third level, the following parameterized problems do not admit a polynomial-time preprocessing algorithm that reduces the size of an instance to polynomial in the parameter:

---Edge Clique Cover, parameterized by the number of cliques, ---Directed Edge/Vertex Multiway Cut, parameterized by the size of the cutset, even in the case of two terminals, ---Edge/Vertex Multicut, parameterized by the size of the cutset, and ---k-Way Cut, parameterized by the size of the cutset.

References

[1]

Pankaj K. Agarwal, Noga Alon, Boris Aronov, and Subhash Suri. 1994. Can visibility graphs be represented compactly? Disc. Computat. Geom. 12, 347--365.

Digital Library

[2]

Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. 1999. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer.

Digital Library

[3]

Michael Behrisch and Anusch Taraz. 2006. Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci. 355, 1, 37--47.

Digital Library

[4]

Hans L. Bodlaender. 2009. Kernelization: New upper and lower bound techniques. In Proceedings of IWPEC. Lecture Notes in Computer Science, vol. 5917, Springer, 17--37.

Digital Library

[5]

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. 2009. On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 8, 423--434.

Digital Library

[6]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2013. Preprocessing for treewidth: A combinatorial analysis through kernelization. SIAM J. Discrete Math. 27, 4, 2108--2142.

[7]

Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. 2014. Kernelization lower bounds by cross-composition. SIAM J. Disc. Math. 28, 1, 277--305.

[8]

Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. 2011. Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412, 35, 4570--4578.

Digital Library

[9]

Nicolas Bousquet, Jean Daligault, and Stéphan Thomassé. 2011. Multicut is FPT. In Proceedings of STOC. 459--468.

Digital Library

[10]

Michel Burlet and Olivier Goldschmidt. 1997. A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21, 5, 225--227.

Digital Library

[11]

Jin-yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, and Mitsunori Ogihara. 2005. Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198, 1, 1--23.

Digital Library

[12]

Gruia Calinescu, Howard J. Karloff, and Yuval Rabani. 2000. An improved approximation algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60, 3, 564--574.

Digital Library

[13]

Maw-Shang Chang and Haiko Müller. 2001. On the tree-degree of graphs. In Proceedings of WG. Lecture Notes in Computer Science, vol. 2204, Springer, 44--54.

Digital Library

[14]

Jianer Chen, Yang Liu, and Songjian Lu. 2009. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55, 1, 1--13.

Digital Library

[15]

Jianer Chen, Yang Liu, Songjian Lu, Barry O’Sullivan, and Igor Razgon. 2008. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55, 5.

Digital Library

[16]

Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, and Dániel Marx. 2013. Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42, 4, 1674--1696.

[17]

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. 2012. Kernelization hardness of connectivity problems in d-degenerate graphs. Disc. Appl. Math. 160, 15, 2131--2141.

Digital Library

[18]

Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, and Jakub Onufry Wojtaszczyk. 2013a. On multiway cut parameterized above lower bounds. ACM Trans. on Computat. Theory 5, 1, 3.

Digital Library

[19]

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. 2013b. Subset feedback vertex set is fixed-parameter tractable. SIAM J. Disc. Math. 27, 1, 290--309.

[20]

Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, and Mihalis Yannakakis. 1994. The complexity of multiterminal cuts. SIAM J. Comput. 23, 4, 864--894.

Digital Library

[21]

Holger Dell and Dániel Marx. 2012. Kernelization of packing problems. In Proceedings of SODA. 68--81.

Digital Library

[22]

Holger Dell and Dieter van Melkebeek. 2010. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proceedings of STOC. ACM, 251--260.

Digital Library

[23]

Michael Dom, Daniel Lokshtanov, and Saket Saurabh. 2009. Incompressibility through colors and IDs. In Proceedings of ICALP. Lecture Notes in Computer Science, vol. 5555, Springer, 378--389.

Digital Library

[24]

Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, and Frances A. Rosamond. 2003. Cutting up is hard to do: The parameterized complexity of k-cut and related problems. Electr. Notes Theoret. Comput. Sci. 78, 209--222.

[25]

Andrew Drucker. 2012. New limits to classical and quantum instance compression. In Proceedings of FOCS. IEEE Computer Society, 609--618.

Digital Library

[26]

Paul Erdös, A. W. Goodman, and Lajos Posa. 1966. The representation of a graph by set intersections. Canad. J. Math. 18, 106--112.

[27]

Lance Fortnow and Rahul Santhanam. 2011. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77, 1, 91--106.

Digital Library

[28]

Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.

Digital Library

[29]

Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. 1996. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 2, 235--251.

Digital Library

[30]

Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. 2004. Multiway cuts in node weighted graphs. J. Algorithms 50, 1, 49--61.

Digital Library

[31]

O. Goldschmidt and D. S. Hochbaum. 1994. A polynomial algorithm for the k-cut problem for fixed k. Math. Oper. Res. 19, 1, 24--37.

[32]

Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. 2008. Data reduction and exact algorithms for clique cover. ACM J. Exper. Algorithmics 13.

Digital Library

[33]

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, and Ramona Schmid. 2007. Algorithms for compact letter displays: Comparison and evaluation. Computat. Stat. Data Anal. 52, 2, 725--736.

Digital Library

[34]

Jonathan L. Gross and Jay Yellen. 2006. Graph Theory and its Applications. CRC Press.

Digital Library

[35]

Jean-Loup Guillaume and Matthieu Latapy. 2004. Bipartite structure of all complex networks. Inf. Process. Lett. 90, 5, 215--221.

Digital Library

[36]

Sylvain Guillemot. 2011. FPT algorithms for path-transversal and cycle-transversal problems. Disc. Optim. 8, 1, 61--71.

Digital Library

[37]

Jiong Guo and Rolf Niedermeier. 2007. Invitation to data reduction and problem kernelization. SIGACT News 38, 1, 31--45.

Digital Library

[38]

Danny Harnik and Moni Naor. 2010. On the compresibility of NP instances and cryptographic applications. SIAM J. Comput. 39, 5, 1667--1713.

Digital Library

[39]

Danny Hermelin and Xi Wu. 2012. Weak compositions and their applications to polynomial lower bounds for kernelization. In Proceedings of SODA. 104--113.

Digital Library

[40]

Douglas N. Hoover. 1992. Complexity of graph covering problems for graphs of low degree. J. Combinat. Math. Combinat. Comput. 11, 187--208.

[41]

Wen-Lian Hsu and Kuo-Hui Tsai. 1991. Linear time algorithms on circular-arc graphs. Inf. Process. Lett. 40, 3, 123--129.

Digital Library

[42]

Yoko Kamidoi, Noriyoshi Yoshida, and Hiroshi Nagamochi. 2007. A deterministic algorithm for finding all minimum k-way cuts. SIAM J. Comput. 36, 5, 1329--1341.

Digital Library

[43]

David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, and Neal E. Young. 2004. Rounding algorithms for a geometric embedding of minimum multiway cut. Math. Oper. Res. 29, 3, 436--461.

Digital Library

[44]

David R. Karger and Clifford Stein. 1996. A new approach to the minimum cut problem. J. ACM 43, 4, 601--640.

Digital Library

[45]

Ken-ichi Kawarabayashi and Mikkel Thorup. 2011. The minimum k-way cut of bounded size is fixed-parameter tractable. In Proceedings of FOCS. 160--169.

Digital Library

[46]

Eduardo Kellerman. 1973. Determination of keyword conflict. IBM Tech. Disclos. Bull. 16, 2, 544--546.

[47]

Lawrence T. Kou, Larry J. Stockmeyer, and Chak-Kuen Wong. 1978. Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM 21, 2, 135--139.

Digital Library

[48]

Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Magnus Wahlström. 2012. Fixed-parameter tractability of multicut in directed acyclic graphs. In Proceedings of ICALP. Lecture Notes in Computer Science, vol. 7391, Springer, 581--593.

Digital Library

[49]

Stefan Kratsch and Magnus Wahlström. 2012a. Compression via matroids: A randomized polynomial kernel for odd cycle transversal. In Proceedings of SODA. 94--103.

Digital Library

[50]

Stefan Kratsch and Magnus Wahlström. 2012b. Representative sets and irrelevant vertices: New tools for kernelization. In Proceedings of FOCS. IEEE Computer Society, 450--459.

Digital Library

[51]

Daniel Lokshtanov, Neeldhara Misra, and Saket Saurabh. 2012. Kernelization -- Preprocessing with a guarantee. In The Multivariate Algorithmic Revolution and Beyond, Hans Bodlaender, Rod Downey, Fedor Fomin, and Dániel Marx Eds., Lecture Notes in Computer Science, vol. 7370. Springer Berlin, 129--161.

Digital Library

[52]

Carsten Lund and Mihalis Yannakakis. 1994. On the hardness of approximating minimization problems. J. ACM 41, 5, 960--981.

Digital Library

[53]

Shaohan Ma, Walter D. Wallis, and Julin Wu. 1989. Clique covering of chordal graphs. Util. Math. 36, 151--152.

[54]

Dániel Marx. 2006. Parameterized graph separation problems. Theoret. Comput. Sci. 351, 3, 394--406.

Digital Library

[55]

Dániel Marx and Igor Razgon. 2011. Fixed-parameter tractability of multicut parameterized by the size of the cutset. In Proceedings of STOC. ACM, 469--478.

Digital Library

[56]

Joseph Naor and Leonid Zosin. 2001. A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput. 31, 2, 477--482.

Digital Library

[57]

James B. Orlin. 1977. Contentment in graph theory: Covering graphs with cliques. Indagationes Mathematicae (Proceedings) 80, 5, 406--424.

[58]

Hans-Peter Piepho. 2004. An algorithm for a letter-based representation of all-pairwise comparisons. J. Computat. Graph. Stat. 13, 2, 456--466.

[59]

Subramanian Rajagopalan, Manish Vachharajani, and Sharad Malik. 2000. Handling irregular ILP within conventional VLIW schedulers using artificial resource constraints. In Proceedings of CASES. 157--164.

Digital Library

[60]

Igor Razgon. 2010. Computing multiway cut within the given excess over the largest minimum isolating cut. CoRR abs/1011.6267.

[61]

Igor Razgon. 2011. Large isolating cuts shrink the multiway cut. CoRR abs/1104.5361 (2011).

[62]

Igor Razgon and Barry O’Sullivan. 2009. Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75, 8, 435--450.

Digital Library

[63]

Bruce A. Reed, Kaleigh Smith, and Adrian Vetta. 2004. Finding odd cycle transversals. Oper. Res. Lett. 32, 4, 299--301.

Digital Library

[64]

Fred S. Roberts. 1985. Applications of edge coverings by cliques. Disc. Appl. Math. 10, 1, 93 -- 109.

[65]

Mikkel Thorup. 2008. Minimum k-way cuts via deterministic greedy tree packing. In Proceedings of STOC. ACM, 159--166.

Digital Library

[66]

Mingyu Xiao. 2010. Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. 46, 4, 723--736.

Digital Library

[67]

Chee-Keng Yap. 1983. Some consequences of non-uniform conditions on uniform classes. Theoret. Comput. Sci. 26, 287--300.

Cited By

Luo W(2022)On some FPT problems without polynomial Turing compressionsTheoretical Computer Science10.1016/j.tcs.2021.12.017905:C(87-98)Online publication date: 22-Feb-2022
https://dl.acm.org/doi/10.1016/j.tcs.2021.12.017
Alman JMnich MWilliams V(2020)Dynamic Parameterized Problems and AlgorithmsACM Transactions on Algorithms10.1145/339503716:4(1-46)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3395037
Kratsch SWahlströM M(2020)Representative Sets and Irrelevant VerticesJournal of the ACM10.1145/339088767:3(1-50)Online publication date: 2-Jun-2020
https://doi.org/10.1145/3390887
Show More Cited By

Index Terms

Clique Cover and Graph Separation: New Incompressibility Results
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Parameterized complexity dichotomy for Steiner Multicut

We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
Known Algorithms for Edge Clique Cover are Probably Optimal

In the Edge Clique Cover (ECC) problem, given an undirected graph $G$ and an integer $k$, we ask whether one can choose $k$ cliques in $G$ such that each edge of $G$ is contained in at least one of the chosen cliques. Gramm et al. [ACM J. Exp. Algorithmics,...
Clique cover and graph separation: new incompressibility results
ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

The field of kernelization studies polynomial-time preprocessing routines for hard problems in the framework of parameterized complexity. In this paper we show that, unless $\textrm{NP} \subseteq \textrm{coNP}/\textrm{poly}$ and the polynomial hierarchy ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computation Theory

ACM Transactions on Computation Theory Volume 6, Issue 2

May 2014

98 pages

ISSN:1942-3454

EISSN:1942-3462

DOI:10.1145/2631196

Editor:
Eric Allender
Rutgers University, USA

Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2014

Accepted: 01 March 2014

Revised: 01 February 2014

Received: 01 January 2013

Published in TOCT Volume 6, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
400
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)4

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Luo W(2022)On some FPT problems without polynomial Turing compressionsTheoretical Computer Science10.1016/j.tcs.2021.12.017905:C(87-98)Online publication date: 22-Feb-2022
https://dl.acm.org/doi/10.1016/j.tcs.2021.12.017
Alman JMnich MWilliams V(2020)Dynamic Parameterized Problems and AlgorithmsACM Transactions on Algorithms10.1145/339503716:4(1-46)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3395037
Kratsch SWahlströM M(2020)Representative Sets and Irrelevant VerticesJournal of the ACM10.1145/339088767:3(1-50)Online publication date: 2-Jun-2020
https://doi.org/10.1145/3390887
Sun YWu CZhang XZhang Z(2020)Computation and algorithm for the minimum k-edge-connectivity of graphsJournal of Combinatorial Optimization10.1007/s10878-020-00541-z44:3(1741-1752)Online publication date: 15-Feb-2020
https://doi.org/10.1007/s10878-020-00541-z
Fomin FLokshtanov DSaurabh SZehavi M(2019)Kernelization10.1017/9781107415157Online publication date: 3-Jan-2019
https://doi.org/10.1017/9781107415157
Pilipczuk MWahlström M(2018)Directed Multicut is W[1]-hard, Even for Four Terminal PairsACM Transactions on Computation Theory10.1145/320177510:3(1-18)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3201775
Fluschnik THermelin DNichterlein ANiedermeier R(2018)Fractals for Kernelization Lower BoundsSIAM Journal on Discrete Mathematics10.1137/16M108874032:1(656-681)Online publication date: 20-Mar-2018
https://doi.org/10.1137/16M1088740
Friedrich THercher C(2018)On the kernel size of clique cover reductions for random intersection graphsJournal of Discrete Algorithms10.1016/j.jda.2015.05.01434:C(128-136)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1016/j.jda.2015.05.014
Le VPeng S(2018)On the complete width and edge clique cover problemsJournal of Combinatorial Optimization10.1007/s10878-016-0106-936:2(532-548)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1007/s10878-016-0106-9
Damaschke P(2017)Calculating approximation guarantees for partial set cover of pairsOptimization Letters10.1007/s11590-017-1108-y11:7(1293-1302)Online publication date: 12-Jan-2017
https://doi.org/10.1007/s11590-017-1108-y
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents