'%20cy='5.2227'%20cx='-20.033'%20r='3.5391'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.9'%3e%3ccircle%20fill-rule='evenodd'%20cx='-2.5033'%20transform='matrix(-.76604%20.64279%20.64279%20.76604%200%200)'%20cy='13.387'%20r='3.5391'%20stroke-width='0'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.8'%3e%3ccircle%20stroke-width='0'%20fill-rule='evenodd'%20transform='matrix(-.17365%20.98481%20.98481%20.17365%200%200)'%20cy='8.3722'%20cx='16.173'%20r='3.5391'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.7'%3e%3ccircle%20fill-rule='evenodd'%20cx='27.257'%20transform='matrix(.5%20.86603%20.86603%20-.5%200%200)'%20cy='-7.474'%20r='3.5391'%20stroke-width='0'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.6'%3e%3ccircle%20stroke-width='0'%20fill-rule='evenodd'%20transform='matrix(.93969%20.34202%20.34202%20-.93969%200%200)'%20cy='-26.738'%20cx='25.562'%20r='3.5391'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.5'%3e%3ccircle%20fill-rule='evenodd'%20cx='11.881'%20transform='matrix(.93969%20-.34202%20-.34202%20-.93969%200%200)'%20cy='-40.405'%20r='3.5391'%20stroke-width='0'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.4'%3e%3ccircle%20stroke-width='0'%20fill-rule='evenodd'%20transform='matrix(.5%20-.86603%20-.86603%20-.5%200%200)'%20cy='-42.081'%20cx='-7.3838'%20r='3.5391'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.3'%3e%3ccircle%20fill-rule='evenodd'%20cx='-23.219'%20transform='matrix(-.17365%20-.98481%20-.98481%20.17365%200%200)'%20cy='-30.981'%20r='3.5391'%20stroke-width='0'%20fill='%23ffffff'/%3e%3c/g%3e%3cg%20opacity='.2'%3e%3ccircle%20stroke-width='0'%20fill-rule='evenodd'%20transform='matrix(-.76604%20-.64279%20-.64279%20.76604%200%200)'%20cy='-12.299'%20cx='-28.215'%20r='3.5391'%20fill='%23ffffff'/%3e%3c/g%3e%3c/svg%3e){kind=small}
Home
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Loading Inventory...
Barnes and Noble
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Current price: $54.99
Barnes and Noble
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Current price: $54.99
Loading Inventory...
Size: OS
*Product Information may vary - to confirm product availability, pricing, and additional information please contact Barnes and Noble
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.
You May Also Like
More About Barnes and Noble at MarketFair Shoppes
Barnes & Noble does business -- big business -- by the book. As the #1 bookseller in the US, it operates about 720 Barnes & Noble superstores (selling books, music, movies, and gifts) throughout all 50 US states and Washington, DC. The stores are typically 10,000 to 60,000 sq. ft. and stock between 60,000 and 200,000 book titles. Many of its locations contain Starbucks cafes, as well as music departments that carry more than 30,000 titles.
Store Info
