Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of the ACM 45, 501–555 (1998)
2. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the Association for Computing Machinery 44(3), 486–504 (1997)
3. Baltz, A., Srivastav, A.: Fast approximation of multicast congestion (2001) (manuscript)
4. Lecture Notes in Computer Science;A. Baltz,2003
5. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Professing Letters 32, 171–176 (1989)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献