LP can be a cure for Parameterized Problems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 338-349

  Narayanaswamy, N S ^a   Raman, Venkatesh ^b   Ramanujan, M S ^b   Saurabh, Saket ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Algorithms and data structures; Graph Algorithms; Parameterized Algorithms

Indexed keywords

ALGORITHMS AND DATA STRUCTURES; GRAPH ALGORITHMS; INTEGER LINEAR PROGRAMMING FORMULATION; LINEAR PROGRAMMING RELAXATION; ODD CYCLE TRANSVERSALS; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS;

COMPUTER SCIENCE; INTEGER PROGRAMMING; PARAMETERIZATION;

ALGORITHMS;

EID: 84880271561     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.338     Document Type: Conference Paper

References (26)

1. H. L. Bodlaender, B. M. P. Jansen, and S. Kratsch. Preprocessing for treewidth: A combinatorial analysis through kernelization. In L. Aceto, M. Henzinger, and J. Sgall, editors, ICALP (1), volume 6755 of Lecture Notes in Computer Science, pages 437-448. Springer, 2011.
2. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett., 58(4): 171-176, 1996.
3. J. Chen, I. A. Kanj, and G. Xia. Improved upper bounds for vertex cover. Theor. Comput. Sci., 411(40-42): 3736-3756, 2010.
4. M. Chlebík and J. Chlebíková. Crown reductions for the minimum weighted vertex cover problem. Discrete Applied Mathematics, 156(3): 292-312, 2008.
5. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk. On multiway cut parameterized above lower bounds. In IPEC, 2011.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
7. J. Flum and M. Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2006.
8. G. Gottlob and S. Szeider. Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. Comput. J., 51(3): 303-325, 2008.
9. F. Hüffner. Algorithm engineering for optimal graph bipartization. J. Graph Algorithms Appl., 13(2): 77-98, 2009.
10. B. M. P. Jansen and H. L. Bodlaender. Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter. In T. Schwentick and C. Dürr, editors, STACS, volume 9 of LIPIcs, pages 177-188. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
11. B. M. P. Jansen and S. Kratsch. On polynomial kernels for structural parameterizations of odd cycle transversal. CoRR, abs/1107.3658, To appear in IPEC 2011.
12. M. Lampis. A kernel of order 2k - c log k for vertex cover. Inf. Process. Lett., 111 (23-24): 1089-1091, 2011.
13. D. Lokshtanov, N. S. Narayanaswamy, V. Raman, M. S. Ramanujan, and S. Saurabh. Improved Parameterized Algorithms using LP. Manuscript, 2012.
14. D. Lokshtanov, S. Saurabh, and S. Sikdar. Simpler parameterized algorithm for oct. In J. Fiala, J. Kratochvíl, and M. Miller, editors, IWOCA, volume 5874 of Lecture Notes in Computer Science, pages 380-384. Springer, 2009.
15. L. Lovász and M. D. Plummer. Matching Theory. North Holland, Oxford, 1986.
16. M. Mahajan and V. Raman. Parameterizing above guaranteed values: Maxsat and maxcut. J. Algorithms, 31(2): 335-354, 1999.
17. D. Marx and I. Razgon. Constant ratio fixed-parameter approximation of the edge multicut problem. Inf. Process. Lett., 109(20): 1161-1166, 2009.
18. S. Mishra, V. Raman, S. Saurabh, S. Sikdar, and C. R. Subramanian. The complexity of könig subgraph problems and above-guarantee vertex cover. Algorithmica, 58, 2010.
19. G. L. Nemhauser and L. E. Trotter. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6: 48-61, 1974. 10.1007/BF01580222.
20. G. L. Nemhauser and L. E. Trotter. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8: 232-248, 1975. 10.1007/BF01580444.
21. J.-C. Picard and M. Queyranne. On the integer-valued variables in the linear vertex packing problem. Mathematical Programming, 12(1): 97-101, 1977.
22. V. Raman, M. S. Ramanujan, and S. Saurabh. Paths, flowers and vertex cover. In C. De-metrescu and M. Halldórsson, editors, Algorithms - ESA 2011, volume 6942 of Lecture Notes in Computer Science, pages 382-393. Springer Berlin / Heidelberg, 2011.
23. I. Razgon and B. O'Sullivan. Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci., 75(8): 435-450, 2009.
24. B. A. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4): 299-301, 2004.
25. S. Saurabh. Exact Algorithms for some parameterized and optimization problems on graphs. PhD thesis, 2008.
26. A. Soleimanfallah and A. Yeo. A kernel of order 2k - c for vertex cover. Discrete Mathematics, 311(10-11): 892-895, 2011.