ENGLISH

Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers

By Roberto Solis-Oba , Giuseppe Persiano (eds.) , Klaus Jansen (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2012
ISBN
978-3-642-29115-9, 978-3-642-29116-6
DOI
10.1007/978-3-642-29116-6
Language
english
Format
PDF
Filesize
3 MB (3138248 bytes)
Series
Lecture Notes in Computer Science 7164
Edition
1
Pages
278\282
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

Similar books