Author:
Chaudhuri Kamalika,Rao Satish,Riesenfeld Samantha,Talwar Kunal
Publisher
Springer Berlin Heidelberg
Reference15 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. Edmonds, J.: Maximum matching and a polyhedron with 0–1 vertices. Journal of Research National Bureau of Standards 69B, 125–130 (1965)
3. Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
4. Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM. Journal on Computing 4(4), 507–518 (1975)
5. Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept. of Computer Science, Cornell University, Ithaca, NY (1993)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献