A polynomial kernel for multicut in trees

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 183-194

  Bousquet, Nicolas ^a   Daligault, Jean ^b   Thomassé, Stéphan ^b   Yeo, Anders ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIV MONTPELLIER   (France)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL KERNELS; MULTICUT IN TREES; POLYNOMIAL KERNELS;

COMPUTER SCIENCE; POLYNOMIALS;

FORESTRY;

EID: 84880204379     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. H.L. Bodlaender, L. Cai, J. Chen, M.R. Fellows, J.A. Telle and D. Marx, Open problems in parameterized and exact computation. In H. L. Bodlaender and M. A. Langston, editors, Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006. Springer Verlag, Lecture Notes in Computer Science, vol. 4169, 2006.
2. 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, vol. 55, 1-19 (2008).
3. M.-C. Costa, L. Letocart and F. Roupin: Minimal multicut and maximal integer multiflow: A survey, European Journal of Operational Research 162(1) 55-69 (2005).
4. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1998.
5. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin. On problems without polynomial kernels (extended abstract). Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2008, 563-574. Springer Verlag, Lecture Notes in Computer Science, vol. 5125, 2008.
6. H. Fernau, F. Fomin, D. Lokshtanov, D. Raible, S. Saurabh and Y. Villanger. Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves, accepted to STACS '08.
7. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
8. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3-20, 1997.
9. J. Guo, Algorithm Design Techniques for Parameterized Graph Modification Problems, Feb. 2006, Ph.D. thesis, Institut für Informatik, Friedrich-Schiller-Universitat, Jena, Germany.
10. J. Guo and R. Niedermeier, Fixed-parameter tractability and data reduction for Multicut in Trees Networks, 46(3), 124-135, 2005, Wiley.
11. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. A CM SIGACT News, 38:31-45, 2007.
12. R. Niedermeier. Invitation to fixed-parameter algorithms. Oxford University Press, 2006.