Sciweavers

IPL
2006

An efficient approximation for the Generalized Assignment Problem

13 years 11 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the knapsack problem into an approximation algorithm for GAP. If the approximation ratio of the knapsack algorithm is and its running time is O(f(N)), our algorithm guarantees a (1 + ) approximation ratio, and it runs in O(M
Reuven Cohen, Liran Katzir, Danny Raz
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Reuven Cohen, Liran Katzir, Danny Raz
Comments (0)