Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications: 3484 (Theoretical Computer Science and General Issues) - Softcover

 
9783540322122: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications: 3484 (Theoretical Computer Science and General Issues)
Softcover
ISBN 10: 3540322124 ISBN 13: 9783540322122
Verlag: Springer Berlin Heidelberg, 2010

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer Berlin Heidelberg
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
3540322124
ISBN 13 
9783540322122
Einband
Tapa blanda
Anzahl der Seiten
360
Herausgeber
Bampis Evripidis
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783540820475: Efficient Approximation and Online Algorithms

Vorgestellte Ausgabe

ISBN 10:  3540820477 ISBN 13:  9783540820475
Verlag: Springer, 2008
Softcover