Approximation and Online Algorithms

18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers

Christos Kaklamanis, Asaf Levin (Herausgeber)

Buch | Softcover

XII, 237 Seiten

2021 | 1st ed. 2021
Springer International Publishing (Verlag)
978-3-030-80878-5 (ISBN)

Artikel merken

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020.

The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications.

Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Design and analysis of algorithms.- Online algorithms, approximation algorithms analysis.- Algorithmic game theory and mechanism design.- Parameterized complexity.- Scheduling algorithms.- Competitive analysis. Packing and covering problems.- Rounding techniques.

Erscheinungsdatum	07.07.2021
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XII, 237 p. 31 illus., 9 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	391 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Adaptive Algorithms • algorithmic game theory • approximation algorithms • approximation algorithms analysis • approximation ratios • approximation scheme • Approximation Theory • combinatorial optimization • Computer Networks • Computer Science • Computer systems • Correlation Analysis • design and analysis of algorithms • Engineering • Graphic methods • graph theory • Internet • Mathematics • Mechanism Design • online algorithms • Optimization • polynomial approximation • Signal Processing • Steiner trees • theoretical computer science
ISBN-10	3-030-80878-5 / 3030808785
ISBN-13	978-3-030-80878-5 / 9783030808785
Zustand	Neuware