An improved approximation algorithm for RESOURCE ALLOCATION

Gruia Calinescu*, Amit Chakrabarti, Howard Karloff, Yuval Rabani

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 Scopus citations


We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity Bof available resource. We show that this NP-hard RESOURCE ALLOCATION problem can be (1/2. ε)-approximated in randomized polynomial time, which improves upon earlier approximation results.

Original languageAmerican English
Article number48
JournalACM Transactions on Algorithms
Issue number4
StatePublished - Sep 2011


  • Approximation algorithm
  • Call admission control
  • Resource allocation


Dive into the research topics of 'An improved approximation algorithm for RESOURCE ALLOCATION'. Together they form a unique fingerprint.

Cite this