A (1-1/e)-approximation algorithm for the generalized assignment problem

Authors:
Zeev Nutov;Israel Beniaminy;Raphael Yuster
Affiliations:
Department of Computer Science, The Open University of Israel, 108 Ravutski St., POB 808, Raanana 43107, Israel;ClickSoftware Technologies, 34 Habarzel St., Tel Aviv 69710, Israel;Department of Mathematics, University of Haifa, Mount Carmel 31905, Israel
Venue:
Operations Research Letters
Year:
2006

Citing 5
Cited 8

Maximum bounded 3-dimensional matching is MAX SNP-complete

Information Processing Letters
An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems

IEEE Transactions on Computers
Approximation of a retrieval problem for parallel disks

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

An efficient approximation for the generalized assignment problem

Information Processing Letters
Multiflows in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Approximating interval scheduling problems with bounded profits

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Min sum edge coloring in multigraphs via configuration LP

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Personal advertisement allocation for mobile TV

Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Sum edge coloring of multigraphs via configuration LP

ACM Transactions on Algorithms (TALG)
Tight Approximation Algorithms for Maximum Separable Assignment Problems

Mathematics of Operations Research
All-or-Nothing generalized assignment with application to scheduling advertising campaigns

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 12.