Treffer: An efficient approximation for the Generalized Assignment Problem
Title:
An efficient approximation for the Generalized Assignment Problem
Authors:
Source:
Information processing letters. 100(4):162-166
Publisher Information:
Amsterdam: Elsevier Science, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Problèmes combinatoires classiques, Classical combinatorial problems, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Informatique théorique, Computer theory, Informática teórica, Meilleure approximation, Best approximation, Mejor aproximación, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème combinatoire, Combinatorial problem, Problema combinatorio, Problème sac à dos, Knapsack problem, Problema mochila, Translation, Translación, Algorithme combinatoire, Combinatorial algorithm, Problème gap, Gap problem, Problème généralisé assignation, Generalized Assignment Problem, Rapport local, Local ratio, Approximation algorithms
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Technion, Haifa 32000, Israel
ISSN:
0020-0190
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18075813
Database:
PASCAL Archive
Weitere Informationen
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 · f(N) + M · N), where N is the number of items and M is the number of bins. Not only does our technique comprise a general interesting framework for the GAP problem; it also matches the best combinatorial approximation for this problem, with a much simpler algorithm and a better running time.