Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Probabilistic approximation of metric spaces and its algorithmic applications;Bartal,1996
2. Finding best swap edges minimizing the routing cost of a spanning tree;Bilò;Algorithmica,2014
3. Approximation algorithms for the p-hub center routing problem in parameterized metric graphs;Chen,2018
4. A note on two problems in connexion with graphs;Dijkstra;Numer. Math.,1959
5. Multi-source spanning tree problems;Farley;J. Interconnect. Netw.,2000
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献