Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Approximation and Online Algorithms -

Approximation and Online Algorithms

11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
Buch | Softcover
X, 169 Seiten
2014 | 2014
Springer International Publishing (Verlag)
978-3-319-08000-0 (ISBN)
CHF 59,90 inkl. MwSt
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.

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.

Erscheint lt. Verlag 5.8.2014
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo X, 169 p. 20 illus.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 284 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • algorithmic game theory • algorithmic trading • approximation algorithms • Coloring • competitive analysis
ISBN-10 3-319-08000-8 / 3319080008
ISBN-13 978-3-319-08000-0 / 9783319080000
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15