Author:
Garg Naveen,Khandekar Rohit,Konjevod Goran,Ravi R.,Salman F. S.,Sinha Amitabh
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal of Computing, 24(3):440–456, 1995.
2. Althöfer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry, 9:81–100, 1993.
3. Andrews, M., Z hang, L.: The access network design problem. Proc. of the 39th Ann. IEEE Symp. on Foundations of Computer Science, 42–49, October 1998.
4. Awerbuch, B., Azar, Y.: Buy at bulk network design. Proc. 38th Ann. IEEE Symposium on Foundations of Computer Science, 542–547, 1997.
5. Bartal, Y.: On approximating arbitrary metrics by tree metrics. Proc. 30th Ann. ACM Symposium on Theory of Computing, 1998.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献