Approximation and Online Algorithms

15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
1. Auflage 2018
ISBN: 978-3-319-89440-9
Verlag: Springer International Publishing

Buch, Englisch, Band 10787, 329 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 517 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Fleischer, Rudolf

Solis-Oba, Roberto

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik

Inhaltsverzeichnis

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.