Efficient Approximation And Online Algorithms: Recent Progress On Classical Combinatorial Optimization Problems And New Applications (lecture Notes In . Computer Science And General Issues)

0

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer, 2006

About this Item

New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Seller Inventory # ABEOCT25-240120

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: Soft cover
• Condition: Brand New

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.