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

Bampis, Evripidis (Editor)/ Jansen, Klaus (Editor)/ Kenyon, Claire (Editor)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer-Verlag New York Inc, 2006

About this Item

1st edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.

Seller Inventory # x-3540322124

Bibliographic Details

• Title: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
• Publisher: Springer-Verlag New York Inc
• Publication Date: 2006
• Language: English
• ISBN 10: 3540322124
• ISBN 13: 9783540322122
• Binding: Paperback
• Condition: Brand New

About this title

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.