Title: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
Publisher: Springer Berlin Heidelberg 2010-06-02
Publication Date: 2010
Language: English
ISBN 10: 3540322124
ISBN 13: 9783540322122
Binding: Paperback
Condition: 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.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Sale & Shipping Terms

Terms of Sale

TBA

Shipping Terms

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	14 to 21 business days	14 to 21 business days
First item	US$ 20.94	US$ 20.94

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.