Approximation and Online Algorithms

17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers

Evripidis Bampis, Nicole Megow (Herausgeber)

Buch | Softcover

XII, 253 Seiten

2020 | 1st ed. 2020
Springer International Publishing (Verlag)
978-3-030-39478-3 (ISBN)

Artikel merken

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.

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.

Erscheinungsdatum	26.01.2020
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XII, 253 p. 44 illus., 25 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	415 g
Themenwelt	Mathematik / Informatik ► Informatik ► Datenbanken
	Mathematik / Informatik ► Informatik ► Netzwerke
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Applications • approximation algorithms • approximation ratios • Approximation Theory • Artificial Intelligence • Bin Packing • combinatorial optimization • competitive ratio • Computer Networks • Computer Science • Computer systems • conference proceedings • Directed graphs • distributed computer systems • Distributed Systems • graph theory • Informatics • Mathematics • On-line Algorithms • online systems • Optimization • polynomial approximation • Research • theoretical computer science
ISBN-10	3-030-39478-6 / 3030394786
ISBN-13	978-3-030-39478-3 / 9783030394783
Zustand	Neuware