Author:
Calinescu Gruia,Grimmer Benjamin,Misra Satyajayant,Tongngam Sutep,Xue Guoliang,Zhang Weiyi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference29 articles.
1. Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. JACM 45(5):753–782
2. Auletta V, Dinitz Y, Nutov Z, Parente D (1999) A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. J Algorithms 32:21–30
3. Borchers A, Du D-Z (1997) The k-Steiner ratio in graphs. SIAM J Comput 26(3):857–869
4. Bryant V (1985) Metric spaces: iteration and application. Cambridge University Press, Cambridge
5. Calinescu G (2012) Relay placement for two-connectivity. In: Bestak R, Kencl L, Li LE, Widmer J, Yin H (eds) Networking (2) lecture notes in computer science, vol 7290. Springer, Berlin, pp 366–377
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献