
Approximation and Online Algorithms
11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
Springer (Publisher)
Published on 5. August 2014
Book
Paperback/Softback
X, 169 pages
978-3-319-08000-0 (ISBN)
Description
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.
More details
Series
Edition
2014 ed.
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Research
Illustrations
20 s/w Abbildungen
X, 169 p. 20 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
283 gr
ISBN-13
978-3-319-08000-0 (9783319080000)
DOI
10.1007/978-3-319-08001-7
Schweitzer Classification
Other editions
Additional editions

Christos Kaklamanis | Kirk Pruhs
Approximation and Online Algorithms
11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
E-Book
06/2014
Springer
€42.79
Available for download
Content
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.