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.
Read More
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.
Read Less
Add this copy of Efficient Approximation and Online Algorithms: Recent to cart. $49.19, very good condition, Sold by GuthrieBooks rated 4.0 out of 5 stars, ships from Spring Branch, TX, UNITED STATES, published 2006 by Springer.
Add this copy of Efficient Approximation and Online Algorithms: Recent to cart. $55.00, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2006 by Springer.
Add this copy of Efficient Approximation and Online Algorithms: Recent to cart. $60.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2006 by Springer.
Add this copy of Efficient Approximation and Online Algorithms to cart. $69.76, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2006 by Springer.
