Lets Explore,

Cover of Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications(Theoretical Computer Science and General Issues)

Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications(Theoretical Computer Science and General Issues)

(Paperback)

Klaus Jansen, Evripidis Bampis, Claire Kenyon,

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (Publisher)

Published

2006

Reviews

Computing and Information Technology

By: Klaus Jansen, Evripidis Bampis, Claire Kenyon | Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG | Released: 06 Feb 2006

Ships within 12-14 days

₹3396.00

₹5307.00

36% off

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.