menu
{ "item_title" : "Approximation and Online Algorithms", "item_author" : [" Klaus Jansen", "Roberto Solis-Oba "], "item_description" : "This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.The 23 revised full papers presented were carefully reviewed andselected from 58 submissions. The workshop covered areas such asalgorithmic game theory, approximation classes, coloring andpartitioning, competitive analysis, computational finance, cuts andconnectivity, geometric problems, inapproximability results, echanismdesign, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterizedcomplexity, randomization techniques, real-world applications, andscheduling problems.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/64/218/317/3642183174_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" : "" } }
Approximation and Online Algorithms|Klaus Jansen

Approximation and Online Algorithms : 8th International Workshop, Waoa 2010, Liverpool, Uk, September 9-10, 2010, Revised Papers

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.

The 23 revised full papers presented were carefully reviewed and
selected from 58 submissions. The workshop covered areas such as
algorithmic game theory, approximation classes, coloring and
partitioning, competitive analysis, computational finance, cuts and
connectivity, geometric problems, inapproximability results, echanism
design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized
complexity, randomization techniques, real-world applications, and
scheduling problems.

This item is Non-Returnable

Details

  • ISBN-13: 9783642183171
  • ISBN-10: 3642183174
  • Publisher: Springer
  • Publish Date: January 2011
  • Dimensions: 9.2 x 6 x 0.6 inches
  • Shipping Weight: 0.95 pounds
  • Page Count: 273

Related Categories

You May Also Like...

    1

BAM Customer Reviews