Publisher
Springer Nature Switzerland
Reference21 articles.
1. Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30, 412–458 (1998)
2. Aggarwal, G., et al.: Achieving anonymity via clustering. Trans. Algorithms 6(3), 1–19 (2010)
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms and Applications. Prentice Hall, Upper Saddle River (1993)
4. Aziz, H., Chan, H., Lee, B., Li, B., Walsh, T.: Facility location problem with capacity constraints: algorithmic and mechanism design perspectives. In Proceedings of AAAI 2020, pp. 1806–1813. AAAI Press (2020)
5. Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms 15(3), 385–415 (1993)