Clique cover and graph separation: New incompressibility results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 254-265

  Cygan, Marek ^a   Kratsch, Stefan ^b   Pilipczuk, Marcin ^c   Pilipczuk, Michał ^d   Wahlström, Magnus ^e  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b UTRECHT UNIVERSITY   (Netherlands)

^c UNIVERSITY OF WARSAW   (Poland)

^d UNIVERSITY OF BERGEN   (Norway)

^e MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED EDGES; HARD PROBLEMS; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME PREPROCESSINGS; TWO TERMINALS;

ALGORITHMS; AUTOMATA THEORY; POLYNOMIALS;

PARAMETERIZATION;

EID: 84876063489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_22     Document Type: Conference Paper

References (35)

1. Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, M.: Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011)
2. Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. SIAM J. Comput. 39(5), 1667-1713 (2010)
3. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
4. Bodlaender, H.L.: Kernelization: New Upper and Lower Bound Techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 17-37. Springer, Heidelberg (2009)
5. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423-434 (2009)
6. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91-106 (2011)
7. Cai, J., Chakaravarthy, V.T., Hemaspaandra, L.A., Ogihara, M.: Competing provers yield improved Karp-Lipton collapse results. Inf. Comput. 198(1), 1-23 (2005)
8. Yap, C.K.: Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci. 26, 287-300 (1983)
9. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: STACS 2011, pp. 165-176 (2011)
10. Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: STOC 2010, pp. 251-260 (2010)
11. Dell, H., Marx, D.: Kernelization of packing problems. In: SODA 2012, pp. 68-81 (2012)
12. Hermelin, D., Wu, X.: Weak compositions and their applications to polynomial lower bounds for kernelization. In: SODA 2012, pp. 104-113 (2012)
13. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570-4578 (2011)
14. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 147-158. Springer, Heidelberg (2010)
15. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through Colors and iDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 378-389. Springer, Heidelberg (2009)
16. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for Treewidth: A Combinatorial Analysis Through Kernelization. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 437-448. Springer, Heidelberg (2011)
17. Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32, 299-301 (2004)
18. Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394-406 (2006)
19. Bousquet, N., Daligault, J., Thomassé, S.: Multicut is FPT. In: STOC 2011, pp. 459-468 (2011)
20. Chitnis, R., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. In: SODA 2012, pp. 1713-1725 (2012)
21. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: STOC 2011, pp. 469-478 (2011)
22. Kawarabayashi, K., Thorup, M.: The minimum k -way cut of bounded size is fixed-parameter tractable. In: FOCS 2011, pp. 160-169 (2011)
23. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
24. Kellerman, E.: Determination of keyword conflict. IBM Technical Disclosure Bulletin 16(2), 544-546 (1973)
25. Agarwal, P.K., Alon, N., Aronov, B., Suri, S.: Can visibility graphs be represented compactly? Discrete & Computational Geometry 12, 347-365 (1994)
26. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R., Piepho, H.P., Schmid, R.: Algorithms for compact letter displays: Comparison and evaluation. Computational Statistics & Data Analysis 52(2), 725-736 (2007)
27. Piepho, H.P.: An algorithm for a letter-based representation of all-pairwise comparisons. Journal of Computational and Graphical Statistics 13(2), 456-466 (2004)
28. Rajagopalan, S., Vachharajani, M., Malik, S.: Handling irregular ILP within conventional VLIW schedulers using artificial resource constraints. In: CASES 2000, pp. 157-164 (2000)
29. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13 (2008)
30. Kratsch, S., Wahlström, M.: Compression via matroids: a randomized polynomial kernel for odd cycle transversal. In: SODA 2012, pp. 94-103 (2012)
31. Kratsch, S., Wahlström, M.: Representative sets and irrelevant vertices: New tools for kernelization. In: CoRR abs/1111.2195 (2011)
32. Burlet, M., Goldschmidt, O.: A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21(5), 225-227 (1997)
33. Goldschmidt, O., Hochbaum, D.S.: A polynomial algorithm for the k -cut problem for fixed k. Math. Oper. Res. 19(1), 24-37 (1994)
34. Thorup, M.: Minimum k-way cuts via deterministic greedy tree packing. In: STOC 2008, pp. 159-166 (2008)
35. Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electr. Notes Theor. Comput. Sci. 78, 209-222 (2003)