|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Evripidis Bampis , Klaus Jansen , Claire KenyonPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2006 ed. Volume: 3484 Dimensions: Width: 15.50cm , Height: 1.90cm , Length: 23.50cm Weight: 0.557kg ISBN: 9783540322122ISBN 10: 3540322124 Pages: 348 Publication Date: 06 February 2006 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |