Author:
Anagnostopoulos Aris,Bent Russell,Upfal Eli,Hentenryck Pascal Van
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference24 articles.
1. Multidimensional binary search trees used for associative searching;Bentley;Commun. ACM,1975
2. A data structure for arc insertion and regular path finding;Buchsbaum;Ann. Math. Artif. Intell.,1991
3. Searching in metric spaces;Chávez;ACM Comput. Surv.,2001
4. F.A. Chudak, D.B. Shmoys, Improved approximation algorithms for a capacitated facility location problem, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’99), ACM-SIAM, NY, 1999, pp. 875–876
5. G. Cornuéjols, G. Nemhauser, L. Wolsey, Discrete Location Theory, Lecture Note in Artificial Intelligence (LNAI 1865), Ch. The Uncapacitated Facility Location Problem, Wiley, 1990, pp. 119–171
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献