Better algorithms and bounds for directed maximum leaf problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4855 LNCS, Issue , 2007, Pages 316-327

  Alon, Noga ^a   Fomin, Fedor V ^b   Gutin, Gregory ^c   Krivelevich, Michael ^a   Saurabh, Saket ^b,d  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF BERGEN   (Norway)

^c UNIVERSITY OF LONDON   (United Kingdom)

^d INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PARAMETERIZATION; PROBLEM SOLVING;

LOCAL SEARCH; MAXIMUM LEAF PROBLEMS;

ALGORITHMS;

EID: 38349002588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_26     Document Type: Conference Paper

References (22)

1. Aarts, E., Lenstra, J.K.: Local search in combinatorial optimization. WileyInterscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Ltd, Chichester (1997)
2. Alon, N., Fomin, F.V., Gutin, G., Krivelevich, M., Saurabh, S.: Parameterized Algorithms for Directed Maximum Leaf Problems. In: Arge, L., Cachin, C., Jurdziñski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 352-362. Springer, Heidelberg (2007)
3. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000)
4. Bienstock, D., Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a forest. J. Comb. Theory Series B 52, 274-283 (1991)
5. Bonsma, P.S., Brueggermann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáš , P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259-268. Springer, Heidelberg (2003)
6. Chung, F.R.K.: Separator theorems and their applications. In: Paths, flows, and VLSI-layout (Bonn, 1988). Algorithms Combin, vol. 9, pp. 17-34. Springer, Berlin (1990)
7. Ding, G., Johnson, Th., Seymour, P.: Spanning trees with many leaves. Journal of Graph Theory 37, 189-197 (2001)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. Manuscript (2007)
10. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-Time Extremal Structure I. In: Proc. ACiD, pp. 1-41 (2005)
11. n. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 152-163. Springer, Heidelberg (2006)
12. Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinated kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 240-251. Springer, Heidelberg (2000)
13. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
14. Galbiati, G., Morzenti, A., Maffioli, F.: On the approximability of some maximum spanning tree problems. Theoretical Computer Science 181, 107-118 (1997)
15. Griggs, J.R., Wu, M.: Spanning trees in graphs of minimum degree four or five. Discrete Mathematics 104, 167-183 (1992)
16. Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4, 99-106 (1991)
17. Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Information Processing Letters 42, 345-350 (1992)
18. Kirousis, L.M., Papadimitriou, C.H.: Interval graphs and searching. Discrete Mathematics 55, 181-184 (1985)
19. Linial, N., Sturtevant, D.: Unpublished result (1987)
20. Lu, H.-L, Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. Journal of Algorithms 29, 132-141 (1998)
21. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
22. Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with the maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 441-452. Springer, Heidelberg (1998)