Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484)
ISBN-13:
9783540322122
ISBN-10:
3540322124
Edition:
2006
Author:
Klaus Jansen, Evripidis Bampis, Claire Kenyon
Publication date:
2006
Publisher:
Springer
Format:
Paperback
356 pages
FREE US shipping
Book details
ISBN-13:
9783540322122
ISBN-10:
3540322124
Edition:
2006
Author:
Klaus Jansen, Evripidis Bampis, Claire Kenyon
Publication date:
2006
Publisher:
Springer
Format:
Paperback
356 pages
Summary
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484) (ISBN-13: 9783540322122 and ISBN-10: 3540322124), written by authors
Klaus Jansen, Evripidis Bampis, Claire Kenyon, was published by Springer in 2006.
With an overall rating of 4.3 stars, it's a notable title among other
books. You can easily purchase or rent Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484) (Paperback) from BooksRun,
along with many other new and used
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
Description
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.
We would LOVE it if you could help us and other readers by reviewing the book
{user}
{createdAt}
{truncated_title}
{author_block}
by {truncated_author}
