
Approximation and Online Algorithms
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: 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 and scheduling problems. von Solis-Oba, Roberto und Persiano, Giuseppe
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
- Kartoniert
- 408 Seiten
- Erschienen 2003
- Springer
- paperback
- 232 Seiten
- Erschienen 1991
- Springer
- hardcover
- 608 Seiten
- Erschienen 1992
- Springer
- Hardcover
- 722 Seiten
- John Wiley & Sons
- Hardcover
- 432 Seiten
- Erschienen 2023
- Wiley & Sons
- Gebunden
- 150 Seiten
- Erschienen 2016
- Springer
- hardcover
- 562 Seiten
- Erschienen 1995
- CRC Press Inc
- Kartoniert
- 813 Seiten
- Erschienen 2011
- Springer
- Hardcover -
- Erschienen 2017
- Springer
- hardcover
- 658 Seiten
- Erschienen 1988
- Elsevier Science Ltd
- hardcover
- 640 Seiten
- Erschienen 1992
- Pearson