Improved approximation algorithms for resource allocation

Gruia Calinescu; Amit Chakrabarti; Howard Karloff; Yuval Rabani

doi:10.1007/3-540-47867-1_28

Improved approximation algorithms for resource allocation

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

63 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 B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-ε)- approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation.We also give a simpler and faster 1/3-approximation algorithm.

Original language	English
Title of host publication	Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings
Editors	William J. Cook, Andreas S. Schulz
Publisher	Springer Verlag
Pages	401-414
Number of pages	14
ISBN (Print)	9783540478676
DOIs	https://doi.org/10.1007/3-540-47867-1_28
State	Published - 2002
Externally published	Yes
Event	9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002 - Cambridge, MA, United States Duration: 27 May 2002 → 29 May 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2337 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002
Country/Territory	United States
City	Cambridge, MA
Period	27/05/02 → 29/05/02

Access to Document

10.1007/3-540-47867-1_28

Cite this

Calinescu, G., Chakrabarti, A., Karloff, H., & Rabani, Y. (2002). Improved approximation algorithms for resource allocation. In W. J. Cook, & A. S. Schulz (Eds.), Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings (pp. 401-414). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2337 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-47867-1_28

Calinescu, Gruia ; Chakrabarti, Amit ; Karloff, Howard et al. / Improved approximation algorithms for resource allocation. Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. editor / William J. Cook ; Andreas S. Schulz. Springer Verlag, 2002. pp. 401-414 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fe6665a613df4c71bdcf775ea902254f,

title = "Improved approximation algorithms 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 B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-ε)- approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation.We also give a simpler and faster 1/3-approximation algorithm.",

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

year = "2002",

doi = "10.1007/3-540-47867-1_28",

language = "אנגלית",

isbn = "9783540478676",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "401--414",

editor = "Cook, {William J.} and Schulz, {Andreas S.}",

booktitle = "Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings",

address = "גרמניה",

note = "9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002 ; Conference date: 27-05-2002 Through 29-05-2002",

}

Calinescu, G, Chakrabarti, A, Karloff, H & Rabani, Y 2002, Improved approximation algorithms for resource allocation. in WJ Cook & AS Schulz (eds), Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2337 LNCS, Springer Verlag, pp. 401-414, 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, Cambridge, MA, United States, 27/05/02. https://doi.org/10.1007/3-540-47867-1_28

Improved approximation algorithms for resource allocation. / Calinescu, Gruia; Chakrabarti, Amit; Karloff, Howard et al.
Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. ed. / William J. Cook; Andreas S. Schulz. Springer Verlag, 2002. p. 401-414 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2337 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improved approximation algorithms for resource allocation

AU - Calinescu, Gruia

AU - Chakrabarti, Amit

AU - Karloff, Howard

AU - Rabani, Yuval

PY - 2002

Y1 - 2002

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 B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-ε)- approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation.We also give a simpler and faster 1/3-approximation algorithm.

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 B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-ε)- approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation.We also give a simpler and faster 1/3-approximation algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84868632657&partnerID=8YFLogxK

U2 - 10.1007/3-540-47867-1_28

DO - 10.1007/3-540-47867-1_28

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84868632657

SN - 9783540478676

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 401

EP - 414

BT - Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings

A2 - Cook, William J.

A2 - Schulz, Andreas S.

PB - Springer Verlag

T2 - 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002

Y2 - 27 May 2002 through 29 May 2002

ER -

Calinescu G, Chakrabarti A, Karloff H, Rabani Y. Improved approximation algorithms for resource allocation. In Cook WJ, Schulz AS, editors, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Springer Verlag. 2002. p. 401-414. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-47867-1_28

Improved approximation algorithms for resource allocation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this