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 proceedingConference contributionpeer-review

62 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 languageAmerican English
Title of host publicationInteger Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings
EditorsWilliam J. Cook, Andreas S. Schulz
PublisherSpringer Verlag
Pages401-414
Number of pages14
ISBN (Print)9783540478676
DOIs
StatePublished - 2002
Externally publishedYes
Event9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002 - Cambridge, MA, United States
Duration: 27 May 200229 May 2002

Publication series

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

Conference

Conference9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002
Country/TerritoryUnited States
CityCambridge, MA
Period27/05/0229/05/02

Fingerprint

Dive into the research topics of 'Improved approximation algorithms for resource allocation'. Together they form a unique fingerprint.

Cite this