Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Evripidis Bampis (u. a.)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer, 2006

Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications | Evripidis Bampis (u. a.) | Taschenbuch | viii | Englisch | 2006 | Springer | EAN 9783540322122 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 102240737

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.

Synopsis: This book provides a good opportunity for computer science practitioners and researchers to get in sync with the 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. This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.

Bibliographic Details

Title: Efficient Approximation and Online ...
Publisher: Springer
Publication Date: 2006
Binding: Taschenbuch
Condition: Neu