Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)

Bampis, Evripidis (Editor)/ Jansen, Klaus (Editor)/ Kenyon, Claire (Editor)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Edité par Springer-Verlag New York Inc, 2006

A propos de cet article

1st edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.

N° de réf. du vendeur x-3540322124

Détails bibliographiques

• Titre: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
• Éditeur: Springer-Verlag New York Inc
• Date de parution: 2006
• Langue: anglais
• ISBN à 10 chiffres: 3540322124
• ISBN à 13 chiffres: 9783540322122
• Reliure: Paperback
• État de l'article: Brand 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.