Author:
Angelopoulos Spyros,Borodin Allan
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. Borodin, M. Nielsen, and C. Rackoff. (Incremental) priority algorithms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 752–761, 2002.
2. M. Charikar, C. Chekuri, T. Feder, and M. Motwani. Incremental clustering and dynamic information retrieval. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 626–634, 1997.
3. V. Chvátal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233–235, 1979.
4. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634–652, 1998.
5. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 649–657, 1998.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献