Approximation and Online Algorithms

17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers
1. Auflage 2020
ISBN: 978-3-030-39478-3
Verlag: Springer

Buch, Englisch, 253 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 411 g

Reihe: Lecture Notes in Computer Science

This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 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; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

Zielgruppe

Research

Autoren/Hrsg.

Bampis, Evripidis

Megow, Nicole

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen

Inhaltsverzeichnis

Graph Algorithms.- Inapproximability Results.- Network Design.- Design and Analysis of Approximation and Online Algorithms.- Parameterized Complexity.- Algorithmic Game Theory.- Algorithmic trading.- Competitive analysis.- Computational Advertising.- Computational finance.- Geometric problems.- Mechanism Design.