Approximation and Online Algorithms

Kirk Pruhs

ISBN 10: 3319080008 / ISBN 13: 9783319080000

Published by Springer International Publishing, Springer International Publishing Aug 2014, 2014

About this Item

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 180 pp. Englisch.

Seller Inventory # 9783319080000

Bibliographic Details

• Title: Approximation and Online Algorithms
• Publisher: Springer International Publishing, Springer International Publishing Aug 2014
• Publication Date: 2014
• Language: English
• ISBN 10: 3319080008
• ISBN 13: 9783319080000
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 11D millimeters 235 millimeters width by 155 millimeters height by 11 millimeters depth
• Weight: 283 grams

About this title

Synopsis

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.