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.
- Pankaj K. Agarwal, Noga Alon, Boris Aronov, and Subhash Suri. 1994. Can visibility graphs be represented compactly? Disc. Computat. Geom. 12, 347--365. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Michael Behrisch and Anusch Taraz. 2006. Efficiently covering complex networks with cliques of similar vertices. Theoret. Comput. Sci. 355, 1, 37--47. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- Nicolas Bousquet, Jean Daligault, and Stéphan Thomassé. 2011. Multicut is FPT. In Proceedings of STOC. 459--468. Google Scholar
Digital Library
- Michel Burlet and Olivier Goldschmidt. 1997. A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21, 5, 225--227. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Gruia Calinescu, Howard J. Karloff, and Yuval Rabani. 2000. An improved approximation algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60, 3, 564--574. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Jianer Chen, Yang Liu, and Songjian Lu. 2009. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica 55, 1, 1--13. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- Holger Dell and Dániel Marx. 2012. Kernelization of packing problems. In Proceedings of SODA. 68--81. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- Andrew Drucker. 2012. New limits to classical and quantum instance compression. In Proceedings of FOCS. IEEE Computer Society, 609--618. Google Scholar
Digital Library
- Paul Erdös, A. W. Goodman, and Lajos Posa. 1966. The representation of a graph by set intersections. Canad. J. Math. 18, 106--112.Google Scholar
Cross Ref
- Lance Fortnow and Rahul Santhanam. 2011. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77, 1, 91--106. Google Scholar
Digital Library
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. 2004. Multiway cuts in node weighted graphs. J. Algorithms 50, 1, 49--61. Google Scholar
Digital Library
- 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. Google Scholar
Cross Ref
- Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. 2008. Data reduction and exact algorithms for clique cover. ACM J. Exper. Algorithmics 13. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Jonathan L. Gross and Jay Yellen. 2006. Graph Theory and its Applications. CRC Press. Google Scholar
Digital Library
- Jean-Loup Guillaume and Matthieu Latapy. 2004. Bipartite structure of all complex networks. Inf. Process. Lett. 90, 5, 215--221. Google Scholar
Digital Library
- Sylvain Guillemot. 2011. FPT algorithms for path-transversal and cycle-transversal problems. Disc. Optim. 8, 1, 61--71. Google Scholar
Digital Library
- Jiong Guo and Rolf Niedermeier. 2007. Invitation to data reduction and problem kernelization. SIGACT News 38, 1, 31--45. Google Scholar
Digital Library
- Danny Harnik and Moni Naor. 2010. On the compresibility of NP instances and cryptographic applications. SIAM J. Comput. 39, 5, 1667--1713. Google Scholar
Digital Library
- Danny Hermelin and Xi Wu. 2012. Weak compositions and their applications to polynomial lower bounds for kernelization. In Proceedings of SODA. 104--113. Google Scholar
Digital Library
- Douglas N. Hoover. 1992. Complexity of graph covering problems for graphs of low degree. J. Combinat. Math. Combinat. Comput. 11, 187--208.Google Scholar
- Wen-Lian Hsu and Kuo-Hui Tsai. 1991. Linear time algorithms on circular-arc graphs. Inf. Process. Lett. 40, 3, 123--129. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- David R. Karger and Clifford Stein. 1996. A new approach to the minimum cut problem. J. ACM 43, 4, 601--640. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Eduardo Kellerman. 1973. Determination of keyword conflict. IBM Tech. Disclos. Bull. 16, 2, 544--546.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Stefan Kratsch and Magnus Wahlström. 2012a. Compression via matroids: A randomized polynomial kernel for odd cycle transversal. In Proceedings of SODA. 94--103. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. DOI:http://dx.doi.org/10.1007/978-3-642-30891-8_10. Google Scholar
Digital Library
- Carsten Lund and Mihalis Yannakakis. 1994. On the hardness of approximating minimization problems. J. ACM 41, 5, 960--981. Google Scholar
Digital Library
- Shaohan Ma, Walter D. Wallis, and Julin Wu. 1989. Clique covering of chordal graphs. Util. Math. 36, 151--152.Google Scholar
- Dániel Marx. 2006. Parameterized graph separation problems. Theoret. Comput. Sci. 351, 3, 394--406. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Joseph Naor and Leonid Zosin. 2001. A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput. 31, 2, 477--482. Google Scholar
Digital Library
- James B. Orlin. 1977. Contentment in graph theory: Covering graphs with cliques. Indagationes Mathematicae (Proceedings) 80, 5, 406--424.Google Scholar
Cross Ref
- Hans-Peter Piepho. 2004. An algorithm for a letter-based representation of all-pairwise comparisons. J. Computat. Graph. Stat. 13, 2, 456--466.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- Igor Razgon. 2010. Computing multiway cut within the given excess over the largest minimum isolating cut. CoRR abs/1011.6267.Google Scholar
- Igor Razgon. 2011. Large isolating cuts shrink the multiway cut. CoRR abs/1104.5361 (2011).Google Scholar
- Igor Razgon and Barry O’Sullivan. 2009. Almost 2-SAT is fixed-parameter tractable. J. Comput. Syst. Sci. 75, 8, 435--450. Google Scholar
Digital Library
- Bruce A. Reed, Kaleigh Smith, and Adrian Vetta. 2004. Finding odd cycle transversals. Oper. Res. Lett. 32, 4, 299--301. Google Scholar
Digital Library
- Fred S. Roberts. 1985. Applications of edge coverings by cliques. Disc. Appl. Math. 10, 1, 93 -- 109.Google Scholar
Cross Ref
- Mikkel Thorup. 2008. Minimum k-way cuts via deterministic greedy tree packing. In Proceedings of STOC. ACM, 159--166. Google Scholar
Digital Library
- Mingyu Xiao. 2010. Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst. 46, 4, 723--736. Google Scholar
Digital Library
- Chee-Keng Yap. 1983. Some consequences of non-uniform conditions on uniform classes. Theoret. Comput. Sci. 26, 287--300.Google Scholar
Cross Ref
Index Terms
Clique Cover and Graph Separation: New Incompressibility Results
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,...
Parameterized complexity of vertex deletion into perfect graph classes
Vertex deletion problems are at the heart of parameterized complexity. For a graph class F, the F-Deletion problem takes as input a graph G and an integer k. The question is whether it is possible to delete at most k vertices from G such that the ...






Comments