menu
{ "item_title" : "Approximation and Online Algorithms", "item_author" : [" Laura Sanità", "Martin Skutella "], "item_description" : "Algorithmic game theory.- Algorithmic trading.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Graph algorithms.- Inapproximability.- Mechanism design.- Natural algorithms.- Network design.- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/31/928/683/3319286838_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|Laura Sanità

Approximation and Online Algorithms : 13th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers

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

Overview

Algorithmic game theory.- Algorithmic trading.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Graph algorithms.- Inapproximability.- Mechanism design.- Natural algorithms.- Network design.- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.

This item is Non-Returnable

Details

  • ISBN-13: 9783319286839
  • ISBN-10: 3319286838
  • Publisher: Springer
  • Publish Date: February 2016
  • Dimensions: 9.21 x 6.14 x 0.46 inches
  • Shipping Weight: 0.69 pounds
  • Page Count: 209

Related Categories

You May Also Like...

    1

BAM Customer Reviews