Author:
Koufogiannakis Christos,Young Neal E.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference66 articles.
1. Albers, S.: On generalized connection caching. Theory Comput. Syst. 35(3), 251–267 (2002)
2. Bansal, N., Buchbinder, N., Naor, J.S.: 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 (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., Even, S.: A linear-time approximation algorithm for the Weighted Vertex Cover problem. J. Algorithms 2(2), 198–203 (1981)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献