Approximation and Online Algorithms
15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers
Seiten
2018
Springer International Publishing (Verlag)
978-3-319-89440-9 (ISBN)
Springer International Publishing (Verlag)
978-3-319-89440-9 (ISBN)
This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.
The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Graph algorithms.- Inapproximability results.- Network design.- Packing and covering.- Paradigms for the design and analysis of approximation and online algorithms.- Parameterized complexity.- Scheduling problems.- Algorithmic game theory.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Mechanism design.- Resource augmentation.- Real-world applications.
| Erscheinungsdatum | 04.04.2018 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 329 p. 42 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 516 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • approximation algorithms • Artificial Intelligence • Bin Packing • cluster analysis • Clustering • combinatorial optimization • data structures • Directed graphs • Game Theory • Graphic methods • graph theory • Nash Equilibrium • Networks • online algorithms • Packing and Covering • planar graph • randomized algorithms • Scheduling • Telecommunication networks |
| ISBN-10 | 3-319-89440-4 / 3319894404 |
| ISBN-13 | 978-3-319-89440-9 / 9783319894409 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2025)
Lehmanns Media (Verlag)
CHF 62,95
die Welt der generativen KI verstehen
Buch | Hardcover (2025)
Hanser (Verlag)
CHF 48,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 46,15
