Representative sets and irrelevant vertices: New tools for kernelization

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 450-459

  Kratsch, Stefan ^a   Wahlström, Magnus ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

almost 2 sat; graph cuts; kernelization; matroids; multiway cut; parameterized complexity

Indexed keywords

ALMOST 2-SAT; GRAPH CUT; KERNELIZATION; MULTIWAY CUT; PARAMETERIZED COMPLEXITY;

COMPUTER SCIENCE; FLOW GRAPHS; GRAPHIC METHODS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 84871993256     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.46     Document Type: Conference Paper

References (48)

1. D. Harnik and M. Naor, "On the compressibility of NP instances and cryptographic applications," SIAM J. Comput., vol. 39, no. 5, pp. 1667-1713, 2010.
2. R. G. Downey and M. R. Fellows, Parameterized Complexity (Monographs in Computer Science). Springer, November 1998.
3. R. Niedermeier, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press, USA, March 2006.
4. H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. M. Thilikos, "(Meta) kernelization," in FOCS. IEEE Computer Society, 2009, pp. 629-638.
5. F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, "Bidimensionality and kernels," in SODA, M. Charikar, Ed. SIAM, 2010, pp. 503-510.
6. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, "On problems without polynomial kernels," J. Comput. Syst. Sci., vol. 75, no. 8, pp. 423-434, 2009.
7. L. Fortnow and R. Santhanam, "Infeasibility of instance compression and succinct PCPs for NP," J. Comput. Syst. Sci., vol. 77, no. 1, pp. 91-106, 2011.
8. H. Dell and D. van Melkebeek, "Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses," in STOC, L. J. Schulman, Ed. ACM, 2010, pp. 251-260.
9. A. Drucker, "New limits to classical and quantum instance compression," MIT, Tech. Rep., 2012, to appear in FOCS 2012. [Online]. Available: http://people.csail.mit.edu/andyd/compression.pdf
10. S. Kratsch and M. Wahlström, "Compression via matroids: a randomized polynomial kernel for odd cycle transversal," in SODA, Y. Rabani, Ed. SIAM, 2012, pp. 94-103.
11. B. N. Dilkina, C. P. Gomes, and A. Sabharwal, "Tradeoffs in the complexity of backdoor detection," in CP, ser. Lecture Notes in Computer Science, C. Bessiere, Ed., vol. 4741. Springer, 2007, pp. 256-270.
12. S. Kottler, M. Kaufmann, and C. Sinz, "Computation of renameable Horn backdoors," in SAT, ser. Lecture Notes in Computer Science, H. K. Büning and X. Zhao, Eds., vol. 4996. Springer, 2008, pp. 154-160.
13. V. Raman, M. S. Ramanujan, and S. Saurabh, "Paths, flowers and vertex cover," in ESA, ser. Lecture Notes in Computer Science, C. Demetrescu and M. M. Halldórsson, Eds., vol. 6942. Springer, 2011, pp. 382-393.
14. G. Gottlob and S. Szeider, "Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems," Comput. J., vol. 51, no. 3, pp. 303-325, 2008.
15. N. S. Narayanaswamy, V. Raman, M. S. Ramanujan, and S. Saurabh, "LP can be a cure for parameterized problems," in STACS, ser. LIPIcs, C. Dürr and T. Wilke, Eds., vol. 14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012, pp. 338-349.
16. "Open problems, WORKER 2010," available at http://fpt.wikidot. com/open-problems.
17. L. Lovász, "Flats in matroids and geometric graphs," in Proc. Sixth British Combinatorial Conf., ser. Combinatorial Surveys, 1977, pp. 45-86.
18. D. Marx, "A parameterized view on matroid optimization problems," Theor. Comput. Sci., vol. 410, no. 44, pp. 4471-4479, 2009.
19. I. Razgon and B. O'Sullivan, "Almost 2-SAT is fixedparameter tractable," J. Comput. Syst. Sci., vol. 75, no. 8, pp. 435-450, 2009.
20. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk, "On multiway cut parameterized above lower bounds," in IPEC, ser. Lecture Notes in Computer Science, D. Marx and P. Rossmanith, Eds., vol. 7112. Springer, 2011, pp. 1-12.
21. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev, "O(√log n) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems," in STOC, H. N. Gabow and R. Fagin, Eds. ACM, 2005, pp. 573-581.
22. S. Khot, "On the power of unique 2-prover 1-round games," in IEEE Conference on Computational Complexity, 2002, p. 25.
23. B. A. Reed, K. Smith, and A. Vetta, "Finding odd cycle transversals," Oper. Res. Lett., vol. 32, no. 4, pp. 299-301, 2004.
24. J. Guo, H. Moser, and R. Niedermeier, "Iterative compression for exactly solving NP-hard minimization problems," in Algorithmics of Large and Complex Networks, ser. Lecture Notes in Computer Science, J. Lerner, D. Wagner, and K. A. Zweig, Eds., vol. 5515. Springer, 2009, pp. 65-80.
25. D. Marx, "Parameterized graph separation problems," Theor. Comput. Sci., vol. 351, no. 3, pp. 394-406, 2006.
26. D. Marx and I. Razgon, "Fixed-parameter tractability of multicut parameterized by the size of the cutset," in STOC, L. Fortnow and S. P. Vadhan, Eds. ACM, 2011, pp. 469-478.
27. S. Guillemot, "FPT algorithms for path-transversal and cycletransversal problems," Discrete Optimization, vol. 8, no. 1, pp. 61-71, 2011.
28. M. Cygan, S. Kratsch, M. Pilipczuk, M. Pilipczuk, and M. Wahlström, "Clique cover and graph separation: New incompressibility results," in ICALP (1), ser. Lecture Notes in Computer Science, A. Czumaj, K. Mehlhorn, A. M. Pitts, and R. Wattenhofer, Eds., vol. 7391. Springer, 2012, pp. 254-265.
29. S. Thomassé, "A 4k2 kernel for feedback vertex set," ACM Transactions on Algorithms, vol. 6, no. 2, 2010.
30. D. Marx and I. Schlotter, "Stable assignment with couples: Parameterized complexity and local search," Discrete Optimization, vol. 8, no. 1, pp. 25-40, 2011.
31. N. Robertson and P. Seymour, "Graph minors. XIII. The disjoint paths problem," Journal of Combinatorial Theory, Series B, vol. 63, no. 1, pp. 65-110, 1995.
32. A. Moitra, "Approximation algorithms for multicommoditytype problems with guarantees independent of the graph size," in FOCS. IEEE Computer Society, 2009, pp. 3-12.
33. J. Chuzhoy, "On vertex sparsifiers with steiner nodes," in STOC, H. J. Karloff and T. Pitassi, Eds. ACM, 2012, pp. 673-688.
34. F. T. Leighton and A. Moitra, "Extensions and limits to vertex sparsification," in STOC, L. J. Schulman, Ed. ACM, 2010, pp. 47-56.
35. S. Kratsch and M. Wahlström, "Representative sets and irrelevant vertices: New tools for kernelization," CoRR, vol. abs/1111.2195, 2011, full version of this extended abstract.
36. H. Perfect, "Applications of Menger's graph theorem," J. Math. Anal. Appl., vol. 22, pp. 96-111, 1968.
37. J. Oxley, Matroid Theory. Oxford University Press, 2011.
38. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
39. H. L. Bodlaender, S. Thomassé, and A. Yeo, "Kernel bounds for disjoint cycles and disjoint paths," Theor. Comput. Sci., vol. 412, no. 35, pp. 4570-4578, 2011.
40. S. Mishra, V. Raman, S. Saurabh, S. Sikdar, and C. Subramanian, "The complexity of König subgraph problems and above-guarantee vertex cover," Algorithmica, vol. 61, pp. 857-881, 2011, 10.1007/s00453-010-9412- 2.
41. B. M. P. Jansen and H. L. Bodlaender, "Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter," in STACS, ser. LIPIcs, T. Schwentick and C. Dürr, Eds., vol. 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 177-188.
42. M. Cygan, M. Pilipczuk, and M. Pilipczuk, "On group feedback vertex set parameterized by the size of the cutset," CoRR, vol. abs/1112.6255, 2011, to appear in WG 2012.
43. A. Gupta, "Improved results for directed multicut," in SODA, 2003, pp. 454-455.
44. H. Dell and D. Marx, "Kernelization of packing problems," in SODA, Y. Rabani, Ed. SIAM, 2012, pp. 68-81.
45. D. Hermelin and X. Wu, "Weak compositions and their applications to polynomial lower bounds for kernelization," in SODA, Y. Rabani, Ed. SIAM, 2012, pp. 104-113.
46. Y. Rabani, Ed., Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. SIAM, 2012.
47. 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. IEEE Computer Society, 2009.
48. L. J. Schulman, Ed., Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM, 2010.