Approximation And Online Algorithms: 13th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Pap by Laura Sanit

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

byLaura SanitEditorMartin Skutella

Paperback | February 3, 2016

Pricing and Purchase Info

$78.57 online 
$85.50 list price save 8%
Earn 393 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.

The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: 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,and real-world applications.

Title:Approximation And Online Algorithms: 13th International Workshop, Waoa 2015, Patras, Greece, Septem...Format:PaperbackProduct dimensions:209 pages, 9.25 X 6.1 X 0 inShipping dimensions:209 pages, 9.25 X 6.1 X 0 inPublished:February 3, 2016Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319286838

ISBN - 13:9783319286839

Appropriate for ages: All ages

Look for similar items by category:

Table of Contents

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.