Result: Greedy approximation via duality for packing, combinatorial auctions and routing
Title:
Greedy approximation via duality for packing, combinatorial auctions and routing
Authors:
Source:
MFCS 2005 : mathematical foundations of computer science (Gdansk, 29 August - 2 September 2005)Lecture notes in computer science. :615-627
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 31 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, 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, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Algorithme glouton, Greedy algorithm, Algoritmo glotón, Borne inférieure, Lower bound, Cota inferior, Enchère, Bidding, Subasta, Informatique théorique, Computer theory, Informática teórica, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème agencement, Layout problem, Problema disposición, Problème remplissage, Bin packing problem, Problema relleno, Programmation linéaire, Linear programming, Programación lineal, Routage, Routing, Enrutamiento, Synthèse mécanisme, Mechanism synthesis, Síntesis mecanismo, Théorie programmation, Programming theory
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Dortmund University, Baroper Str. 301, 44221 Dortmund, Germany
ISSN:
0302-9743
Rights:
Copyright 2005 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
Accession Number:
edscal.17096489
Database:
PASCAL Archive
Further Information
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This enables to significantly improve on the approximation ratios of these greedy methods, and gives a unified analysis of greedy for many packing problems. We show matching lower bounds on the ratios of such greedy methods. Applications to some specific problems, including mechanism design for combinatorial auctions, are also shown.