Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers / edited by Roberto Solis-Oba, Giuseppe Persiano.

Format:

Book

Contributor:

Solis-Oba, Roberto, editor.

Persiano, Giuseppe, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 7164.

Theoretical Computer Science and General Issues ; 7164

Language:

English

Subjects (All):

Algorithms.

Computer science--Mathematics.

Computer science.

Numerical analysis.

Computer graphics.

Application software.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Graphics.

Information Systems Applications (incl. Internet).

Local Subjects:

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Numeric Computing.

Computer Graphics.

Information Systems Applications (incl. Internet).

Algorithms.

Physical Description:

1 online resource (X, 278 pages).

Edition:

First edition 2012.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.

System Details:

text file PDF

Summary:

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.

Other Format:

Printed edition:

ISBN:

978-3-642-29116-6

9783642291166

Access Restriction:

Restricted for use by site license.