A unified approach to approximating resource allocation and scheduling
By A. Bar-Noy, R. Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor, Baruch Schieber. JACM, 2001
394 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/1de76a8d8c9cc76f3ab761e0b41ec5eab015b8f1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Moran Feldman
- Roy Schwartz
- Joseph (Seffi) Naor
- Alex Kulesza
- B. Taskar
- Jan Vondr'ak
- Francis R. Bach
- Jennifer Gillenwater
In Computer Networks and Communications
- Moran Feldman
- Roy Schwartz
- Joseph (Seffi) Naor
- Francis R. Bach
- Alex Kulesza
- B. Taskar
- Aranyak Mehta
- Jan Vondr'ak
Citations in the corpus
- Dependent rounding and its applications to approximation algorithms (2006, neutral): “How does a user-request get satised? Suppose a user requests page p at time t. Then, there is a parameter k such that this request gets satised when page p has been broadcast at k dierent time-slots t 0 that are larger than t .T he \natural" choice for k, as in [25, 15, 31, 5 , 6] (and as in the pr”
- A Unified Continuous Greedy Algorithm for Submodular Maximization (2011, background): “The previously best approximation ratio for this problem approached 1− e−1 for large k values [4].”