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

Evripidis Bampis, Klaus Jansen, Claire Kenyon

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Verlag: Springer Berlin Heidelberg 2010-06-02, 2010

Beschreibung

Bestandsnummer des Verkäufers 6666-IUK-9783540322122

Bibliografische Details

• Titel: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
• Verlag: Springer Berlin Heidelberg 2010-06-02
• Erscheinungsjahr: 2010
• Sprache: Englisch
• ISBN-10: 3540322124
• ISBN-13: 9783540322122
• Einband: Paperback
• Zustand: New

Über diesen Titel

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.