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

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.

Seller Inventory # OTV.3540322124.G

Bibliographic Details

• Title: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484)
• Publisher: Springer
• Publication Date: 2006
• Language: English
• ISBN 10: 3540322124
• ISBN 13: 9783540322122
• Binding: Soft cover
• Condition: good

About this title

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.