0

Efficient Approximation and Online Algorithms

Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Lecture Notes in Computer Science 3484 - Theoretical Computer Science and General Issues

Erschienen am 06.02.2006, Auflage: 1/2006
53,49 €
(inkl. MwSt.)

Lieferbar innerhalb 1 - 2 Wochen

In den Warenkorb
Bibliografische Daten
ISBN/EAN: 9783540322122
Sprache: Englisch
Umfang: viii, 348 S.
Einband: kartoniertes Buch

Beschreibung

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.