Kernel(S) for problems with no kernel: On out-trees with many leaves (extended abstract)

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 421-432

  Fernau, Henning ^a   Fomin, Fedor V ^b   Lokshtanov, Daniel ^b   Raible, Daniel ^a   Saurabh, Saket ^b   Villanger, Yngve ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Kernelization; Lower bounds; Max leaf; Out branching; Parameterized algorithms

Indexed keywords

KERNELIZATION; LOWER BOUNDS; MAX-LEAF; OUT-BRANCHING; PARAMETERIZED ALGORITHM;

ALGORITHMS; COMPUTER SCIENCE;

POLYNOMIALS;

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

References (25)

1. N. Alon, F. V. Fomin, G. Gutin, M. Krivelevich, S. Saurabh. Parameterized algorithms for Directed Maximum Leaf problems. ICALP, LNCS 4596, 352-362 (2007).
2. N. Alon, F. V. Fomin, G. Gutin, M. Krivelevich, S. Saurabh. Better algorithms and bounds for Directed Maximum Leaf problems. FSTTCS, LNCS 4855, 316-327 (2007).
3. H. L. Bodlaender, E. D. Demaine, M. R. Fellows, J. Guo, D. Hermelin, D. Lokshtanov, M. Müller, V. Raman, J. van Rooij, F. A. Rosamond. Open problems in parameterized and exact computation - IWPEC 2008. Technical Report UU-CS-2008-017, Dept. of Inform. and Comput. Sci., Utrecht Univ.
4. H. L. Bodlaender, R. G. Downey, M. R. Fellows, D. Hermelin. On problems without polynomial kernels. ICALP, LNCS 5125, 563-574 (2008).
5. P. S. Bonsma, T. Brueggermann, G. J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. MFCS, LNCS 2747, 259-268 (2003).
6. P. S. Bonsma and F. Dorn. Tight bounds and faster algorithms for Directed Max-Leaf Spanning Tree. ESA, LNCS 5193, 222-233 (2008).
7. Y. Caro, D. B. West, R. Yuster. Connected domination and spanning trees with many leaves. SIAM J. Discrete Math. 13, 202-211 (2000).
8. J. Chen, H. Fernau, I. A. Kanj, G. Xia. Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077-1106 (2007).
9. J. Chen, I. A. Kanj, W. Jia. Vertex Cover: further observations and further improvements. J. Algorithms 41, 280-301 (2001).
10. J. Daligaut, G. Gutin, E. Jung Kim, A. Yeo. FPT algorithms and kernels for the Directed k-Leaf Problem. Technical Report 0810.4946v2, ArXiv, 2008.
11. G. Ding, Th. Johnson, P. Seymour. Spanning trees with many leaves. J. Graph Theory 37, 189-197 (2001).
12. M. Drescher and A. Vetta. An approximation algorithm for the maximum leaf spanning arborescence problem. To appear in ACM Trans. Algorithms.
13. V. Estivill-Castro, M. R. Fellows, M. A. Langston, F. A. Rosamond, FPT is P-Time extremal structure I. Proc. ACiD, 1-41, (2005).
14. M. R. Fellows. The lost continent of polynomial time: preprocessing and kernelization. IWPEC, LNCS 4169, 276-277 (2006).
15. M. R. Fellows, C. McCartin, F. A. Rosamond, U. Stege. Coordinated kernels and catalytic reductions: an improved FPT algorithm for Max Leaf Spanning Tree and other problems. FSSTCS, LNCS 1974, 240-251 (2000).
16. G. Galbiati, A. Morzenti, F. Maffioli. On the approximability of some maximum spanning tree problems. Theoret. Comp. Sci. 181, 107-118 (1997).
17. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACT News. 38, 31-45 (2007).
18. R. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations (Symposium Proceedings), Plenum Press (1972).
19. D. J. Kleitman and D. B. West. Spanning trees with many leaves. SIAM J. Discrete Mathematics 4, 99-106 (1991).
20. J. Kneis, A. Langer and P. Rossmanith. A new algorithm for finding trees with many leaves. To appear in Proc. of ISAAC 2008.
21. N. Linial and D. Sturtevant. Storer's lower bound holds even for graphs with minimum degree three. (quoted in [19])
22. H. I. Lu and R. Ravi. Approximating maximum leaf spanning trees in almost linear time. J. Algorithms 29, 132-141 (1998).
23. R. Solis-Oba. 2-approximation algorithm for finding a spanning tree with the maximum number of leaves. ESA, LNCS 1461, 441-452 (1998).
24. J. A. Storer. Constructing full spanning trees for cubic graphs. Inf. Process. Lett. 13, 8-11, 1981.
25. S. Thomassé. A quadratic kernel for feedback vertex set. To appear in Proc. of SODA 2009.