Near optimal online algorithms and fast approximation algorithms for resource allocation problems.
Nikhil R. DevanurKamal JainBalasubramanian SivanChristopher A. WilkensPublished in: EC (2011)
Keyphrases
- approximation algorithms
- online algorithms
- resource allocation problems
- worst case
- resource allocation
- np hard
- lower bound
- online learning
- average case
- competitive ratio
- special case
- vertex cover
- upper bound
- learning algorithm
- resource constraints
- constant factor
- approximation ratio
- greedy algorithm
- precedence constraints
- asymptotically optimal
- sample size
- graphical models
- optimal solution