Approximation and Online Algorithms
13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
Nonfiction, Computers, Database Management, Data Processing, General Computing, Programming
| Author: | ISBN: | 9783319286846 | |
| Publisher: | Springer International Publishing | Publication: | January 12, 2016 |
| Imprint: | Springer | Language: | English |
| Author: | |
| ISBN: | 9783319286846 |
| Publisher: | Springer International Publishing |
| Publication: | January 12, 2016 |
| Imprint: | Springer |
| Language: | English |
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.
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.
