Approximation and Online Algorithms

Kirk Pruhs

ISBN 10: 3319080008 / ISBN 13: 9783319080000

Editore: Springer International Publishing, Springer International Publishing Aug 2014, 2014

Riguardo questo articolo

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.

Codice articolo 9783319080000

Dati bibliografici

• Titolo: Approximation and Online Algorithms
• Editore: Springer International Publishing, Springer International Publishing Aug 2014
• Data di pubblicazione: 2014
• Lingua: Inglese
• ISBN 10: 3319080008
• ISBN 13: 9783319080000
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 11 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 11 millimetri di profondità
• Peso: 283 grammi

Descrizione articolo

Riassunto

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.

Contenuti

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.