Author:
Chaudhuri Kamalika,Rao Satish,Riesenfeld Samantha,Talwar Kunal
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Chan, T.M.: Euclidean bounded-degree spanning tree ratios. In: Proceedings of the nineteenth annual symposium on Computational geometry, pp. 11–19. ACM Press, New York (2003)
2. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would edmonds do? augmenting paths and witnesses for bounded degree msts. In: Proceedings of APPROX/RANDOM (2005)
3. Edmonds, J.: Maximum matching and a polyhedron with 0–1 vertices. Journal of Research National Bureau of Standards 69B, 125–130 (1965)
4. Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept of Computer Science, Cornell University, Ithaca, NY (1993)
5. Fürer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. Journal of Algorithms 17(3), 409–423 (1994)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献