Author:
Bateni MohammadHossein,Hajiaghayi MohammadTaghi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting steiner tree and TSP. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 427–436 (2009)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753–782 (1998)
3. Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)
4. Bateni, M., Hajiaghayi, M.: Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 805–814 (2009)
5. Bateni, M., Hajiaghayi, M.: Euclidean prize-collecting Steiner forest. In: Proceedings of the 9th Latin American Theoretical Informatics Symposium, LATIN, pp. 503–514 (2010)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献