Author:
Koufogiannakis Christos,Young Neal E.
Publisher
Springer Berlin Heidelberg
Reference53 articles.
1. Albers, S.: On generalized connection caching. Theory of Computing Systems 35(3), 251–267 (2002)
2. Bansal, N., Buchbinder, N., Naor, J.: A primal-dual randomized algorithm for weighted paging. In: The forty-third IEEE symposium on Foundations Of Computer Science, pp. 507–517 (2007)
3. Bansal, N., Buchbinder, N., Naor, J.S.: Randomized competitive algorithms for generalized caching. In: The fourtieth ACM Symposium on Theory Of Computing, pp. 235–244. ACM, New York (2008)
4. Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica 27(2), 131–144 (2000)
5. Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: a unified framework for approximation algorithms. ACM Computing Surveys 36(4), 422–463 (2004)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献