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

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer, 2006

About this Item

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_420790828

Bibliographic Details

Title: Efficient Approximation and Online ...

Publisher: Springer

Publication Date: 2006

Binding: paperback

Condition: Good

About this title

Synopsis:

Efficient Approximation And Online Algorithms: Recent Progress On Classical Combinatorial Optimization Problems And New Applications (lecture Notes In ... Computer Science And General Issues)

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.