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

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

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" may belong to another edition of this title.

Other Popular Editions of the Same Title

9783540820475: Efficient Approximation and Online Algorithms

Featured Edition

ISBN 10:  3540820477 ISBN 13:  9783540820475
Publisher: Springer, 2008
Softcover