Approximation and Online Algorithms [electronic resource] : 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers / edited by Klaus Jansen, Roberto Solis-Oba.

Contributor(s):

Series: Lecture Notes in Computer Science ; 6534Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: X, 273 p. 18 illus., 3 illus. in color. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783642183188

Subject(s):

Genre/Form:

Electronic books.

Additional physical formats: Printed edition:: No titleDDC classification:

005.1 23

LOC classification:

QA76.9.A43

Online resources:

Click here to access online

In: Springer eBooksSummary: This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewed and selected from 58 submissions. The workshop covered areas such as 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, real-world applications, and scheduling problems.

Item type:

eBooks

Average rating: 0.0 (0 votes)

Holdings ( 0 )
Title notes ( 1 )

No physical items for this record

This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event. The 23 revised full papers presented were carefully reviewed and selected from 58 submissions. The workshop covered areas such as 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, real-world applications, and scheduling problems.