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

Bampis, Evripidis [Editor]; Jansen, Klaus [Editor]; Kenyon, Claire [Editor];

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer, 2006

About this Item

Ex-library paperback in very nice condition with the usual markings and attachments.

Seller Inventory # DA1411315

Bibliographic Details

• Title: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in . Computer Science and General Issues)
• Publisher: Springer
• Publication Date: 2006
• Language: English
• ISBN 10: 3540322124
• ISBN 13: 9783540322122
• Binding: Paperback
• Condition: Very Good
• Weight: 19 ounces

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.