Author:
Amzallag David,Naor Joseph (Seffi),Raz Danny
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Lecture Notes in Computer Science;A. Ageev,1999
2. Amzallag, D., Engelberg, R., Naor, J., Raz, D.: Approximation algorithms for cell planning problems (2006) (Manuscript)
3. Amzallag, D., Livschitz, M., Naor, J., Raz, D.: Cell planning of 4G cellular networks: Algorithmic techniques, and results. In: Proceedings of the 6th IEE International Conference on 3G & Beyond (3G 2005), pp. 501–506 (2005)
4. Chekuri, C., Khanna, S., Shepherd, F.B.: The all-or-nothing multicommodity flow problem. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 156–165 (2004)
5. Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 162–171 (2006)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献