menu
{ "item_title" : "Approximation and Online Algorithms", "item_author" : [" Evripidis Bampis", "Nicole Megow "], "item_description" : "This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/03/039/478/3030394786_b.jpg", "price_data" : { "retail_price" : "64.99", "online_price" : "64.99", "our_price" : "64.99", "club_price" : "64.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 : 17th International Workshop, Waoa 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers

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

Overview

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

This item is Non-Returnable

Details

  • ISBN-13: 9783030394783
  • ISBN-10: 3030394786
  • Publisher: Springer
  • Publish Date: January 2020
  • Dimensions: 9.21 x 6.14 x 0.56 inches
  • Shipping Weight: 0.84 pounds
  • Page Count: 253

Related Categories

You May Also Like...

    1

BAM Customer Reviews