Verwandte Artikel zu Efficient Approximation and Online Algorithms: Recent...

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

 
9783540322122: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484, Band 3484)
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.

Verlag
Springer Berlin Heidelberg
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
3540322124
ISBN 13 
9783540322122
Einband
Taschenbuch
Anzahl der Seiten
360
Herausgeber
Bampis Evripidis
Kontakt zum Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Tiergartenstr. 17
Heidelberg
69121
Deutschland