Compression via matroids: A randomized polynomial kernel for odd cycle transversal

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 94-103

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; ITERATIVE METHODS; MACHINERY; MATRIX ALGEBRA; OPERATIONS RESEARCH;

APPROXIMATE SOLUTION; FALSE NEGATIVES; LOWER BOUND TECHNIQUES; ODD CYCLE TRANSVERSALS; POLYNOMIAL KERNELS; POLYNOMIAL-TIME; PROBLEM INSTANCES; TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 84860210460     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.8     Document Type: Conference Paper

References (57)

1. 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 H. N. Gabow and R. Fagin, editors, STOC, pages 573-581. ACM, 2005. (Pubitemid 43098630)
2. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Ann. of Math, 2:781-793, 2002. (Pubitemid 40447851)
3. N. Alon, G. Gutin, E. Kim, S. Szeider, and A. Yeo. Solving MAX-r-SAT above a tight lower bound. Algorithmica, pages 1-18, 2010.
4. A. Avidor and M. Langberg. The multi-multiway cut problem. Theor. Comput. Sci., 377(1-3):35-42, 2007. (Pubitemid 46670576)
5. S. Bessy, F. V. Fomin, S. Gaspers, C. Paul, A. Perez, S. Saurabh, and S. Thomassé. Kernels for feedback arc set in tournaments. In R. Kannan and K. N. Kumar, editors, FSTTCS, volume 4 of LIPIcs, pages 37-47. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2009.
6. S. Böcker, F. Hüffner, A. Truß, and M. Wahlström. A faster fixed-parameter approach to drawing binary tanglegrams. In Chen and Fomin [15], pages 38-49.
7. H. L. Bodlaender. A cubic kernel for feedback vertex set. In W. Thomas and P. Weil, editors, STACS, volume 4393 of Lecture Notes in Computer Science, pages 320-331. Springer, 2007.
8. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin. On problems without polynomial kernels. J. Comput. Syst. Sci., 75(8):423-434, 2009.
9. H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. M. Thilikos. (Meta) kernelization. In FOCS, pages 629-638. IEEE Computer Society, 2009.
10. H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. M. Thilikos. (meta) kernelization. CoRR, abs/0904.0727, 2009.
11. H. L. Bodlaender, S. Thomassé, and A. Yeo. Kernel bounds for disjoint cycles and disjoint paths. In A. Fiat and P. Sanders, editors, ESA, volume 5757 of Lecture Notes in Computer Science, pages 635-646. Springer, 2009.
12. N. Bousquet, J. Daligault, and S. Thomassé. Multicut is FPT. In Fortnow and Vadhan [28], pages 459-468.
13. K. Burrage, V. Estivill-Castro, M. R. Fellows, M. A. Langston, S. Mac, and F. A. Rosamond. The undirected feedback vertex set problem has a poly(k) kernel. In H. L. Bodlaender and M. A. Langston, editors, IWPEC, volume 4169 of Lecture Notes in Computer Science, pages 192-202. Springer, 2006.
14. M. Charikar, editor. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. SIAM, 2010.
15. J. Chen and F. V. Fomin, editors. Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, volume 5917 of Lecture Notes in Computer Science. Springer, 2009.
16. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. J. Algorithms, 41(2):280-301, 2001. (Pubitemid 33665542)
17. J. Chen, Y. Liu, and S. Lu. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica, 55(1):1-13, 2009.
18. J. Chen, Y. Liu, S. Lu, B. O'Sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5), 2008.
19. H. Dell and D. van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In L. J. Schulman, editor, STOC, pages 251-260. ACM, 2010.
20. M. Dom, D. Lokshtanov, and S. Saurabh. Incompressibility through colors and IDs. In S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. E. Nikoletseas, and W. Thomas, editors, ICALP (1), volume 5555 of Lecture Notes in Computer Science, pages 378-389. Springer, 2009.
21. R. G. Downey and M. R. Fellows. Parameterized Complexity (Monographs in Computer Science). Springer, November 1998.
22. V. Estivill-Castro, M. R. Fellows, M. A. Langston, and F. A. Rosamond. FPT is P-time extremal structure I. In H. Broersma, M. Johnson, and S. Szeider, editors, ACiD, volume 4 of Texts in Algorithmics, pages 1-41. King's College, London, 2005.
23. H. Fernau, M. Kaufmann, and M. Poths. Comparing trees via crossing minimization. J. Comput. Syst. Sci., 76(7):593-608, 2010.
24. S. Fiorini, N. Hardy, B. A. Reed, and A. Vetta. Planar graph bipartization in linear time. Discrete Applied Mathematics, 156(7):1175-1180, 2008. (Pubitemid 351329421)
25. J. Flum and M. Grohe. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, March 2006.
26. F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos. Bidimensionality and kernels. In Charikar [14], pages 503-510.
27. L. Fortnow and R. Santhanam. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci., 77(1):91-106, 2011.
28. L. Fortnow and S. P. Vadhan, editors. Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. ACM, 2011.
29. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput., 25(2):235-251, 1996. (Pubitemid 126577270)
30. M. Grohe and R. Niedermeier, editors. Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, volume 5018 of Lecture Notes in Computer Science. Springer, 2008.
31. S. Guillemot. FPT algorithms for path-transversals and cycle-transversals problems in graphs. In Grohe and Niedermeier [30], pages 129-140.
32. l-free edge modification problems. In V. Raman and S. Saurabh, editors, IPEC, volume 6478 of Lecture Notes in Computer Science, pages 147-157. Springer, 2010.
33. J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke. Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst Sci., 72(8): 1386-1396, 2006. (Pubitemid 44647241)
34. J. Guo, H. Moser, and R. Niedermeier. Iterative compression for exactly solving NP-hard minimization problems. In J. Lerner, D. Wagner, and K. A. Zweig, editors, Algorithmics of Large and Complex Networks, volume 5515 of Lecture Notes in Computer Science, pages 65-80. Springer, 2009.
35. D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. SIAM J. Comput., 39(5):1667-1713, 2010.
36. F. Hüffner. Algorithm engineering for optimal graph bipartization. In S. E. Nikoletseas, editor, WEA, volume 3503 of Lecture Notes in Computer Science, pages 240-252. Springer, 2005.
37. F. Hüffner. Algorithm engineering for optimal graph bipartization. J. Graph Algorithms Appl., 13(2):77-98, 2009.
38. F. Hüffner, N. Betzier, and R. Niedermeier. Separator-based data reduction for signed graph balancing. J. Comb. Optim., 20(4):335-360, 2010.
39. B. Jansen and S. Kratsch. Vertex and edge bipartization with nonstandard parameters: Upper and lower bounds for kernelization, 2011. Unpublished manuscript.
40. K. Kawarabayashi and B. A. Reed. An (almost) linear time algorithm for odd cycles transversal. In Charikar [14], pages 365-378.
41. S. Khot. On the power of unique 2-prover 1-round games. In IEEE Conference on Computational Complexity, page 25, 2002.
42. S. Kratsch and M. Wahlström. Two edge modification problems without polynomial kernels. In Chen and Fomin [15], pages 264-275.
43. D. Lokshtanov. Wheel-free deletion is W[2]-hard. In Grohe and Niedermeier [30], pages 141-147.
44. D. Lokshtanov, S. Saurabh, and S. Sikdar. Simpler parameterized algorithm for OCT. In J. Fiala, J. Kratochvil, and M. Miller, editors, IWOCA, volume 5874 of Lecture Notes in Computer Science, pages 380-384. Springer, 2009.
45. D. Marx. Parameterized graph separation problems. Theor. Comput. Sci., 351(3):394-406, 2006. (Pubitemid 43207633)
46. D. Marx. A parameterized view on matroid optimization problems. Theor. Comput. Sci., 410(44):4471-4479, 2009.
47. D. Marx and I. Razgon. Fixed-parameter tractability of multicut parameterized by the size of the cutset. In Fortnow and Vadhan [28], pages 469-478.
48. N. Misra, V. Raman, and S. Saurabh. Lower bounds on kernelization. Discrete Optimization, 8(1):110-128, 2011.
49. A. Natanzon, R. Shamir, and R. Sharan. A polynomial approximation algorithm for the minimum fill-in problem. SIAM J. Comput., 30(4):1067-1079, 2000.
50. G. Nemhauser and L. Trotter. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
51. R. Niedermeier. Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications). Oxford University Press, USA, March 2006.
52. J. Oxley. Matroid Theory. Oxford University Press, 2nd edition, 2011.
53. H. Perfect. Applications of menger's graph theorem. J. Math. Anal. Appl., 22:96-111, 1968.
54. I. Razgon and B. O'Sullivan. Almost 2-SAT is fixed-parameter tractable. J. Comput Syst Sci., 75(8):435-450, 2009.
55. B. A. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4):299-301, 2004.
56. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003.
57. 2 kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 2010.