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

Martin Skutella

ISBN 10: 3319286838 / ISBN 13: 9783319286839

Editore: Springer International Publishing, 2016

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering - 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, algorithmictrading, coloring and partitioning, competitive analysis, computational advertising,computational finance, cuts and connectivity, geometric problems, graphalgorithms, inapproximability, mechanism design, natural algorithms, networkdesign, packing and covering, paradigms for the design and analysis of approximationand online algorithms, parameterized complexity, scheduling problems,and real-world applications. Codice articolo 9783319286839

Dati bibliografici

Titolo: Approximation and Online Algorithms : 13th ...

Casa editrice: Springer International Publishing

Data di pubblicazione: 2016

Legatura: Taschenbuch

Condizione: Neu

Descrizione articolo

Riassunto:

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.