Spanning trees with minimum weighted degrees

Information Processing Letters

Volumn 104, Issue 3, 2007, Pages 113-116

  Ghodsi, Mohammad ^a,b   Mahini, Hamid ^a,b   Mirjalali, Kian ^a   Oveis Gharan, Shayan ^a   Sayedi R , Amin S ^a   Zadimoghaddam, Morteza ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

Author keywords

Approximation algorithms; Graph algorithms; Spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING;

GRAPH ALGORITHMS; SPANNING TREES;

TREES (MATHEMATICS);

EID: 34547661751     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.06.011     Document Type: Article

References (16)

1. M.X. Goemans, Bounded degree minimum spanning trees, in: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 273-282
2. R. Ravi, M. Singh, Delegate and conquer: An LP-based approximation algorithms for minimum degree MSTs, in: Proc. of the 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 169-180
3. Camerini P.M., and Galbiati G. The bounded path tree problem. SIAM Journal on Algebraic and Discrete Methods 3 4 (1982) 474-484
4. Camerini P.M., Galbiati G., and Maffioli F. Complexity of spanning tree problems. Part I, European Journal of Operations Research 5 (1980) 346-352
5. K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar, Push relabel and an improved approximation algorithm for the bounded-degree MST problem, in: Proc. of the 33rd International Colloquium on Automata, Languages and Programming, 2006, pp. 191-201
6. Camerini P.M., Galbiati G., and Maffioli F. On the complexity of finding multi-constrained spanning trees. Discrete Applied Mathematics 5 (1983) 39-50
7. K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar, What would Edmonds do? Augmenting paths, witnesses and improved approximations for bounded-degree MSTs, in: Proc. of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2005
8. M. Furer, B. Raghavachari, An NC approximation algorithm for the minimum degree spanning tree problem, in: Proc. of the 28th Ann Allerton Conference on Communication, Control and Computing, 1990, pp. 274-281
9. M. Furer, B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optima degree, in: Proc. of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 317-324
10. K. Kalpakis, K. Dasgupta, P. Namjoshi, Maximum lifetime data gathering and aggregation in wireless sensor networks, in: Proc. of IEEE International Conference on Networking, 2002
11. Klein P.N., Krishnan R., Raghavachari B., and Ravi R. Approximation algorithms for finding low-degree subgraphs. Networks 44 3 (2004) 203-215
12. J. Konemann, R. Ravi, A matter of degree: Improved approximation algorithms for degree-bounded minimum divining trees, in: Proc. of the 32nd Annual ACM Symposium on Theory of Computing, 2000
13. B. Krishnamachari, D. Estrin, S. Wicker, Modelling data-centric routing in wireless sensor networks, in: Proc. of IEEE INFOCOM, 2002
14. Papadimitriou C.H., and Yannakakis M. The complexity of restricted spanning tree problems. Journal of the ACM 29 (1982) 285-309
15. R. Ravi, Steiner trees and beyond: Approximation algorithms for network design, PhD thesis, available as Technical Report TR-CS- 93-41, Brown University, September 1993
16. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, H.B. Hunt, Many birds with one stone: multi-objective approximation algorithms, in: Proc. of the 25th Annual ACM Symposium on Theory of Computing, 1993