Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference33 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
2. Alon, N., Karp, R.M., Peleg, D., West, D.B.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78–100 (1995)
3. Lecture Notes in Computer Science;E. Amaldi,2004
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)
5. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, STOCS, pp. 161–168 (1998)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献