An amortized search tree analysis for k-leaf spanning tree

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

Volumn 5901 LNCS, Issue , 2010, Pages 672-684

  Raible, Daniel ^a   Fernau, Henning ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM ANALYSIS; ALGORITHMICS; PARAMETERIZED; RUNNING TIME; SEARCH TREES; SPANNING TREE; UNDIRECTED GRAPH;

COMPUTER SCIENCE;

EID: 77249095407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11266-9_56     Document Type: Conference Paper

References (19)

1. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected Dominating Set in Sensor Networks and MANETs. In: Handbook of Comb. Opt., vol. B, pp. 329-369. Springer, Heidelberg (2005)
2. Bonsma, P.S., Brueggemann, 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)
3. Bonsma, P.S., Zickfeld, F.: A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. In: Broersma, H., Erlebach, T., Friedet-zky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 66-77. Springer, Heidelberg (2008)
4. Bonsma, P.S., Zickfeld, F.: Spanning Trees with Many Leaves in Graphs without Diamond and Blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 531-543. Springer, Heidelberg (2008)
5. Chen, J., Kanj, I.A., Xia, G.: Labeled Search Trees and Amortized Analysis: Improved upper Bounds for NP-Hard Problems. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 148-157. Springer, Heidelberg (2003)
6. Daligault, J., Gutin, G., Kim, E.J., Yeo, A.: FPT Algorithms and Kernels for the Directed k-Leaf Problem. Journal of Computer and System Sciences (2009), http://dx.doi.org/10.1016/j.jcss.2009.06.005
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-Time Extremal Structure I. In: ACiD, pp. 1-41. King's College Publications, London (2005)
9. Fernau, H., Langer, A., Liedloff, M., Kneis, J.: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 161-172. Springer, Heidelberg (2009)
10. Fernau, H., Raible, D.: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 144-156. Springer, Heidelberg (2008)
11. Fernau, H., Gaspers, S., Raible, D.: Exact and Parameterized Algorithms for Max Internal Spanning Tree. In: WG (to appear, 2009)
12. Fomin, F.V., Grandoni, F., Kratsch, D.: A Measure & Conquer Approach for the Analysis of Exact Algorithms. Journal of the ACM 56(5) (2009)
13. n. Algorithmica 52(2), 153-166 (2008)
14. Kneis, J., Langer, A., Rossmanith, P.: A New Algorithm for Finding Trees with Many Leaves. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 270-281. Springer, Heidelberg (2008)
15. Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., et al. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 653-664. Springer, Heidelberg (2009)
16. Lu, H.-I., Ravi, R.: Approximating Maximum Leaf Spanning Trees in Almost Linear Time. Journal of Algorithms 29, 132-141 (1998)
17. Solis-Oba, R.: 2-Approximation Algorithm for Finding a Spanning Tree with 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)
18. Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected Dominating Sets in Wireless Networks Different Transmission Ranges. IEEE Trans. Mobile Computing 6, 1-10 (2007)
19. Wahlström, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD Thesis, Department of Computer and Information Science, Linköpings Universitet, Sweden (2007)