Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers: 6534 (Lecture Notes in Computer Science)

ISBN 10: 3642183174 / ISBN 13: 9783642183171

Published by Springer, 2011

About this Item

pp. 288.

Seller Inventory # 5842659

Bibliographic Details

• Title: Approximation and Online Algorithms: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers: 6534 (Lecture Notes in Computer Science)
• Publisher: Springer
• Publication Date: 2011
• Language: English
• ISBN 10: 3642183174
• ISBN 13: 9783642183171
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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, echanism
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.

From the Back Cover

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.