Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484)
Language: English
Published by Springer, 2006
- Softcover
- Used
Condition: Used - Good
US$ 35.88
Quantity: 1 available
Add to basketItem description from seller
Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.
Seller Inventory # S_420790828
- 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 year
- 2006
- Condition
- Good
- Binding
- paperback
- Language
- English
- ISBN 10
- 3540322124
- ISBN 13
- 9783540322122
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.
"Synopsis" may belong to another edition of this title.
Shipping rates within U.S.A.
| Item | 4 to 14 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 3.75 | US$ 6.99 |
Payment methods
Store description
Half Price Books has been connecting readers to great books since 1972. Customer service is our top priority.
Specialty
AllSeller's business information
Half Price Books, Records, Magazines, Inc.
5803 E. Northwest Hwy.
Dallas, TX U.S.A. 75231