Author:
Chen Hui,Campbell Ann,Thomas Barrett,Tamir Arie
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference39 articles.
1. Exact and heuristic algorithms for the optimum communication spanning tree problem;Ahuja;Transport Sci,1987
2. Approximating k-hop minimum spanning trees;Althaus;Oper Res Lett,2005
3. Tree spanners;Cai;SIAM J Discrete Math,1995
4. Network design for time-constrained delivery;Chen;Naval Res Logist,2008
5. L.P. Chew, There is a planar graph almost as good as the complete graph, Proceedings of the Second Annual Symposium on Computational Geometry, New York, NY, USA, 1986, pp. 169-177.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献