Book Chapter10.1007/3-540-47867-1_28
Improved Approximation Algorithms for Resource Allocation
Gruia Calinescu,Amit Chakrabarti,Howard Karloff,Yuval Rabani +3 more
- 27 May 2002
- pp 401-414
TL;DR: It is shown that this NP-hard Resource Allocation problem can be (1/2-?)-approximated in polynomial time, which improves upon earlier approximation results for this problem.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Approximation Algorithms for the Unsplittable Flow Problem
TL;DR: The main technique used for these results is randomized rounding followed by greedy alteration, and is inspired by the use of this idea in recent work.
Multicommodity demand flow in a tree and packing integer programs
TL;DR: In this article, the integrality gap of the natural linear programming relaxation is at most 4 for the case of arbitrary profits and at most 11.542 times that for the unit-demand case.
143
A quasi-PTAS for unsplittable flow on line graphs
Nikhil Bansal,Amit Chakrabarti,Amir Epstein,Baruch Schieber +3 more
- 21 May 2006
TL;DR: A deterministic quasi-polynomial time approximation scheme for UFP on line graphs, thereby ruling out an APX-hardness result, unless NP ⊆ DTIME(2polylog(n)), which requires a quasi- polynomial bound on all edge capacities and demands in the input instance.
Approximation algorithms for the job interval selection problem and related scheduling problems
Julia Chuzhoy,Rafail Ostrovsky +1 more
- 14 Oct 2001
TL;DR: The authors consider the job interval selection problem (JISP), a simple scheduling model with a rich history and numerous applications, and shows an approximation guarantee of less than 1.582 for arbitrary instances of JISP.
Approximation Algorithms for the Unsplittable Flow Problem
TL;DR: The first constant-factor approximation algorithms for the unsplittable flow problem (UFP) on undirected graphs are presented, focusing on the non-uniform capacity case in which the edge capacities can vary arbitrarily over the graph.
References
A faster strongly polynomial minimum cost flow algorithm
James B. Orlin
- 01 Jan 1988
TL;DR: This algorithm improves the best previous strongly polynomial algorithm due to Galil and Tardos, by a factor of m/n, and is even more efficient if the number of arcs with finite upper bounds, say m', is much less than m.
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
TL;DR: This algorithm solves the uncapacitated minimum cost flow problem as a sequence of On log n shortest path problems on networks with n nodes and m arcs and runs in On log nm + n log n time.
A unified approach to approximating resource allocation and scheduling
TL;DR: A general framework for solving resource allocation and scheduling problems, given a resource of fixed size, and presents algorithms that approximate the maximum throughput or the minimum loss by a constant factor.
A unified approach to approximating resource allocation and scheduling
Amotz Bar-Noy,Reuven Bar-Yehuda,Ari Freund,Joseph (Seffi) Naor,Baruch Schieber +4 more
- 01 May 2000
TL;DR: A general framework for solving resource allocation and scheduling problems, given a resource of fixed size, and presents algorithms that approximate the maximum throughput or the minimum loss by a constant factor.