z-logo
open-access-imgOpen Access
Admission control to minimize rejections and online set cover with repetitions
Author(s) -
Noga Alon,
Yossi Azar,
Shai Gutner
Publication year - 2009
Publication title -
acm transactions on algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.093
H-Index - 57
eISSN - 1549-6333
pISSN - 1549-6325
DOI - 10.1145/1644015.1644026
Subject(s) - competitive analysis , online algorithm , set cover problem , preemption , computer science , randomized algorithm , admission control , set (abstract data type) , cover (algebra) , function (biology) , binary logarithm , control (management) , generalization , upper and lower bounds , mathematics , algorithm , combinatorics , artificial intelligence , computer network , mechanical engineering , mathematical analysis , quality of service , evolutionary biology , engineering , biology , programming language , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom