Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. A simple and deterministic competitive algorithm for online facility location;Anagnostopoulos;Inform. and Comput.,2004
2. Local search heuristics for k-median and facility location problems;Arya;SIAM J. Comput.,2004
3. Online Computation and Competitive Analysis;Borodin,1998
4. M. Charikar, C. Chekuri, T. Feder, R. Motwani. Incremental clustering and dynamic information retrieval, in: Proc. 29th ACM Symp. on Theory of Computing (STOC ’97), 1997, pp. 626–635.
5. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, in: Proc. 40th IEEE Symp. on Foundations of Computer Science (FOCS ’99), 1999, pp. 378–388.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献