Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications

Bampis, Evripidis (EDT); Jansen, Klaus (EDT); Kenyon, Claire (EDT)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Edité par Springer, 2006

A propos de cet article

N° de réf. du vendeur 6909096-n

Détails bibliographiques

• Titre: Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications
• Éditeur: Springer
• Date de parution: 2006
• Langue: anglais
• ISBN à 10 chiffres: 3540322124
• ISBN à 13 chiffres: 9783540322122
• Reliure: Couverture souple
• État de l'article: New

A propos de ce titre

Synopsis

This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.