Kernelization of packing problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 68-81

  Dell, Holger ^a   Marx, Dániel ^b,c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

GRAPH PACKING; KERNELIZATION; LOWER-BOUND PROOFS; PACKING PROBLEMS; POLYNOMIAL-TIME REDUCTION; VERTEX COVER PROBLEMS; VERTEX DISJOINT; VERTEX DISJOINT PATHS;

GRAPH THEORY;

EID: 84860136983     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.6     Document Type: Conference Paper

References (35)

1. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8):423-434, 2009.
2. Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos. (Meta) Kernelization. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pages 629-638, 2009.
3. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-composition: A new technique for kernelization lower bounds. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 165-176, 2011.
4. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Preprocessing for treewidth: A combinatorial analysis through kernelization. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, volume 6755 of Lecture Notes in Computer Science, pages 437-448. Springer, 2011.
5. Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo. Kernel bounds for disjoint cycles and disjoint paths. In Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009, volume 5757 of Lecture Notes in Computer Science, pages 635-646. Springer, 2009.
6. 2) steps. In Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), volume 3353 of Lecture Notes in Computer Science, pages 257-269. Springer, 2004.
7. Yijia Chen, Jörg Flum, and Moritz Müller. Lower bounds for kernelizations and other preprocessing procedures. Theory of Computing Systems, 48(4):803-839, 2011.
8. Rod G. Downey and Michael R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer, New York, 1999.
9. Michael Dom, Daniel Lokshtanov, and Saket Saurabh. Incompressibility through colors and IDs. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, volume 5555 of Lecture Notes in Computer Science, pages 378-389. Springer, 2009.
10. Holger Dell and Dieter van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proceedings of the 42th Annual ACM Symposium on Theory of Computing, STOC 2010, pages 251-260. ACM, 2010.
11. Paul Erdös and Richard Rado. Intersection theorems for systems of sets. Journal of the London Mathematical Society, 35:85-90, 1960.
12. Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, and Yngve Villanger. Kernel(s) for problems with no kernel: On out-trees with many leaves. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, volume 3 of Leibniz International Proceedings in Informatics (LIPIcs), pages 421-432, 2009.
13. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Springer, 2006.
14. Michael R. Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, and Jan Arne Telle. Finding k disjoint triangles in an arbitrary graph. In Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), volume 3353 of Lecture Notes in Computer Science, pages 235-244. Springer, 2004.
15. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, and Sue Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica, 52:167-176, 2008.
16. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Bidimensionality and kernels. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pages 503-510. SIAM, 2010.
17. Henning Fernau and Daniel Raible. A parameterized perspective on packing paths of length two. Journal of Combinatorial Optimization, 18(4):319-341, 2009.
18. Lance Fortnow and Rahul Santhanam. Infeasibility of instance compression and succinct PCPs for NP. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pages 133-142. ACM, 2008.
19. Jiong Guo. A more effective linear kernelization for cluster editing. Theoretical Computer Science, 410(8-10):718-726, 2009.
20. Danny Hermelin and Xi Wu. Weak compositions and their applications to polynomial lower bounds for kernelization. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. SIAM, 2011.
21. Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, 43:85-103, 1972.
22. David G. Kirkpatrick and Pavol Hell. On the completeness of a generalized matching problem. In Proceedings of the 10th annual ACM Symposium on Theory of Computing, STOC 1978, pages 240-245. ACM, 1978.
23. Stefan Kratsch, Dániel Marx, and Magnus Wahlström. Parameterized complexity and kernelizability of max ones and exact ones problems. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, pages 489-500, 2010.
24. Stefan Kratsch and Magnus Wahlström. Two edge modification problems without polynomial kernels. In Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009, volume 5917 of Lecture Notes in Computer Science, pages 264-275. Springer, 2009.
25. Stefan Kratsch and Magnus Wahlström. Preprocessing of min ones problems: A dichotomy. In Proceedings of the 37th Colloquium on Automata, Languages and Programming, ICALP 2010, volume 6198 of Lecture Notes in Computer Science, pages 653-665. Springer, 2010.
26. Daniel Lokshtanov, Matthias Mnich, and Saket Saurabh. A linear kernel for a planar connected dominating set. Theoretical Computer Science, 412(23):2536-2543, 2011.
27. Hannes Moser. A problem kernelization for graph packing. In Proceedings of the 35th Conference on Current Trends om Theory and Practice of Computer Science, SOFSEM 2009, volume 5404 of Lecture Notes in Computer Science, pages 401-412. Springer, 2009.
28. Luke Mathieson, Elena Prieto, and Peter Shaw. Packing edge disjoint triangles: A parameterized view. In Proceedings of the First International Workshop on Parameterized and Exact Computation, IWPEC 2004, volume 3162 of Lecture Notes in Computer Science, pages 127-137. Springer, 2004.
29. Neeldhara Misra, Venkatesh Raman, and Saket Saurabh. Lower bounds on kernelization. Discrete Optimization, 8(1):110-128, 2011.
30. Rolf Niedermeier. Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2006.
31. George L. Nemhauser and Leslie E. Trotter Jr. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6(1):48-61, 1974.
32. Elena Prieto and Christian Sloper. Looking at the stars. Theoretical Computer Science, 351(3):437-445, 2006.
33. 2 kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 2010.
34. 2-packing. Information Processing Letters, 110(5):188-192, 2010.
35. Raphael Yuster. Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review, 1(1):12-26, 2007.