Author:
Chaudhuri Kamalika,Rao Satish,Riesenfeld Samantha,Talwar Kunal
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. N. Bansal, R. Khandekar, V. Nagarajan, Additive guarantees for degree bounded directed network design, in: STOC, 2008, pp. 769–778
2. Euclidean bounded-degree spanning tree ratios;Chan,2003
3. K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar, What would Edmonds do? Augmenting paths and witnesses for bounded degree MSTs, in: Proceedings of APPROX/RANDOM, 2005, pp. 26–39
4. K. Chaudhuri, S. Rao, S Riesenfeld, K. Talwar, A push-relabel algorithm for approximating degree-bounded spanning trees, in: Proceedings of ICALP, 2006, pp. 191–201
5. Maximum matching and a polyhedron with 0–1 vertices;Edmonds;Journal of Research National Bureau of Standards,1965
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献