Description
Approximation and Online Algorithms, 1st ed. 2015
13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
Theoretical Computer Science and General Issues Series
Coordinators: Sanità Laura, Skutella Martin
Language: English
Subjects for Approximation and Online Algorithms:
Keywords
Algorithm analysis; Competitive analysis; Geometric problems; Parameterized complexity; Temporal graphs; Algorithms; Approximation algorithms; Coloring; Design and analysis of algorithms; Discrete mathematics in computer science; Fixed-parameter tractable algorithm; Network design; Numeric computing; Online algorithms; Online scheduling; Packing and covering; Problem complexity; Random input; Randomization techniques; Temporal connectivity; algorithm analysis and problem complexity
209 p. · 15.5x23.5 cm · Paperback
Description
/li>Contents
/li>Comment
/li>
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.
Includes supplementary material: sn.pub/extras
