An improved approximation algorithm for RESOURCE ALLOCATION

Gruia Calinescu; Amit Chakrabarti; Howard Karloff; Yuval Rabani

doi:10.1145/2000807.2000816

An improved approximation algorithm for RESOURCE ALLOCATION

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

Abstract

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 language	American English
Article number	48
Journal	ACM Transactions on Algorithms
Volume	7
Issue number	4
DOIs	https://doi.org/10.1145/2000807.2000816
State	Published - Sep 2011

Keywords

Approximation algorithm
Call admission control
Resource allocation

Access to Document

10.1145/2000807.2000816

Cite this

@article{d203f782dad14811b9a93ef5a35d204c,

title = "An improved approximation algorithm for RESOURCE ALLOCATION",

abstract = "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.",

keywords = "Approximation algorithm, Call admission control, Resource allocation",

author = "Gruia Calinescu and Amit Chakrabarti and Howard Karloff and Yuval Rabani",

year = "2011",

month = sep,

doi = "10.1145/2000807.2000816",

language = "American English",

volume = "7",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

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 - Article

AN - SCOPUS:80053488211

SN - 1549-6325

VL - 7

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 4

M1 - 48

ER -

An improved approximation algorithm for RESOURCE ALLOCATION

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this