An approximation algorithm for the maximum leaf spanning arborescence problem

ACM Transactions on Algorithms

Volumn 6, Issue 3, 2010, Pages

  Drescher, Matthew ^a   Vetta, Adrian ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Arborescence; Directed graphs; Maximum leaf

Indexed keywords

ARBORESCENCE; DIRECTED GRAPHS; SPECIAL CLASS;

GRAPH THEORY; GRAPHIC METHODS;

APPROXIMATION ALGORITHMS;

EID: 77954388894     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1798596.1798599     Document Type: Article

References (11)

1. ALON, N., FOMIN, F., GUTIN, G., KRIVELEVICH, M., AND SAURABH, S. 2007a. Better algorithms and bounds for directed maximum-leaf problems.
2. ALON, N., FOMIN, F., GUTIN, G., KRIVELEVICH, M., AND SAURABH, S. 2007b. Parameterized algorithms for directed maximum leaf problems. In Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP-07). 352-362.
3. BONSMA, P. AND DORN, F. 2007. An fpt algorithm for directed spanning k-leaf.
4. CHLEBIK, M. AND CHLEBIKOVA, J. 2004. Approximation hardness for dominating set problems. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA-04). 192-203.
5. GALBIATI, G., MAFFIOLI, F., AND MORZENTI, A. 2004. A short note on the approximability of the maximum leaves spanning tree problem. Inform. Proces. Lett. 52, 45-49.
6. GUHA, S. AND KHULLER, S. 1996. Approximation algorithms for connected dominating sets. In Proceedings of the European Symposium on Algorithms. 179-193.
7. LU, H. AND RAV I , R. 1992. The power of local optimzation: Approximation algorithms for maximum-leaf spanning tree. In Proceedings of the 30th Annual Allerton Conference on Communication, Control and Computing. 533-542.
8. LU, H. AND RAV I , R. 1998. Approximating maximum leaf spanning trees in almost linear time. J. Algor. 29, 1, 132-141.
9. PAYAN , C., TCHUENTE, M., AND XUONG, N. 1984. Arbes avec un nombre de maximum de sommets pendants. Disc. Math. 49, 267-273.
10. SOLIS-OBA, R. 1998. 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In Proceedings of the European Symposium on Algorithms. 441-452.
11. STORER, J. 1981. Constructing full spanning trees for cubic graphs. Inform. Process. Lett. 13, 8-11.