Author:
Bar-Yehuda Reuven,Bendel Keren,Freund Ari,Rawitz Dror
Reference62 articles.
1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3): 440–456 (1995).
2. S. Albers, S. Arora, and S. Khanna. Page replacement for general caching problems. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms, (1999) pp. 31–40.
3. E. M. Arkin and E. B. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18: 1–8 (1987).
4. S. Arora and C. Lund. Hardness of approximations. In Hochbaum [44], chapter 10, pp. 399–446.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3): 501–555 (1998).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献