menu
{ "item_title" : "Approximation and Online Algorithms", "item_author" : [" Evripidis Bampis", "Klaus Jansen "], "item_description" : "This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 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, mechanism 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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/64/212/449/3642124496_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|Evripidis Bampis

Approximation and Online Algorithms : 7th International Workshop, WAOA 2009 Copenhagen, Denmark, September 10-11, 2009 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 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 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, mechanism 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: 9783642124495
  • ISBN-10: 3642124496
  • Publisher: Springer
  • Publish Date: April 2010
  • Dimensions: 9.2 x 6.1 x 0.6 inches
  • Shipping Weight: 0.88 pounds
  • Page Count: 255

Related Categories

You May Also Like...

    1

BAM Customer Reviews