menu
{ "item_title" : "Approximation and Online Algorithms", "item_author" : [" Jaroslaw Byrka", "Andreas Wiese "], "item_description" : "This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/03/149/814/3031498143_b.jpg", "price_data" : { "retail_price" : "69.99", "online_price" : "69.99", "our_price" : "69.99", "club_price" : "69.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|Jaroslaw Byrka

Approximation and Online Algorithms : 21st International Workshop, Waoa 2023, Amsterdam, the Netherlands, September 7-8, 2023, Proceedings

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

Overview

This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023

The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems

This item is Non-Returnable

Details

  • ISBN-13: 9783031498145
  • ISBN-10: 3031498143
  • Publisher: Springer
  • Publish Date: December 2023
  • Dimensions: 9.21 x 6.14 x 0.53 inches
  • Shipping Weight: 0.78 pounds
  • Page Count: 236

Related Categories

You May Also Like...

    1

BAM Customer Reviews