{
"item_title" : "Efficient Approximation and Online Algorithms",
"item_author" : [" Evripidis Bampis", "Klaus Jansen", "Claire Kenyon "],
"item_description" : "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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/54/032/212/3540322124_b.jpg",
"price_data" : {
"retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540322122
- ISBN-10: 3540322124
- Publisher: Springer
- Publish Date: February 2006
- Dimensions: 9.21 x 6.14 x 0.75 inches
- Shipping Weight: 1.12 pounds
- Page Count: 348
Related Categories
