Funder
Australian Research Council
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. Additive guarantees for degree-bounded directed network design;Bansal;SIAM J. Comput.,2009
2. Glencora Borradaile, Hung Le, Christian Wulff-Nilsen, Greedy spanners are optimal in doubling metrics, in: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 2371–2379.
3. On hierarchical routing in doubling metrics;Chan;ACM Trans. Algorithms,2016
4. A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids;Chaudhuri;Theoret. Comput. Sci.,2009
5. What would edmonds do? Augmenting paths and witnesses for degree-bounded MSTs;Chaudhuri;Algorithmica,2009