
Approximation and Online Algorithms
18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers
Springer (Publisher)
Published on 6. July 2021
Book
Paperback/Softback
XII, 237 pages
978-3-030-80878-5 (ISBN)
Description
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.
More details
Series
Edition
1st ed. 2021
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
22 s/w Abbildungen, 9 farbige Abbildungen
XII, 237 p. 31 illus., 9 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 14 mm
Weight
388 gr
ISBN-13
978-3-030-80878-5 (9783030808785)
DOI
10.1007/978-3-030-80879-2
Schweitzer Classification
Other editions
Additional editions

Christos Kaklamanis | Asaf Levin
Approximation and Online Algorithms
18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers
E-Book
07/2021
Springer
€160.49
Available for download
Content
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.