TY - JOUR
T1 - An improved approximation algorithm for RESOURCE ALLOCATION
AU - Calinescu, Gruia
AU - Chakrabarti, Amit
AU - Karloff, Howard
AU - Rabani, Yuval
PY - 2011/9
Y1 - 2011/9
N2 - 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.
AB - 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.
KW - Approximation algorithm
KW - Call admission control
KW - Resource allocation
UR - http://www.scopus.com/inward/record.url?scp=80053488211&partnerID=8YFLogxK
U2 - 10.1145/2000807.2000816
DO - 10.1145/2000807.2000816
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:80053488211
SN - 1549-6325
VL - 7
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 4
M1 - 48
ER -