TY  - BOOK
AU  - Kaklamanis,Christos
AU  - Pruhs,Kirk
ED  - SpringerLink (Online service)
TI  - Approximation and Online Algorithms: 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers 
T2  - Lecture Notes in Computer Science,
SN  - 9783319080017
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2014///
CY  - Cham
PB  - Springer International Publishing, Imprint: Springer
KW  - Computer Science
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Algorithms
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Numeric Computing
N1  - Algorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability results -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Real-world applications -- Scheduling problems
N2  - This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems
UR  - http://dx.doi.org/10.1007/978-3-319-08001-7
ER  -