Approximation and online algorithms : 18th International Workshop, WAOA 2020, Virtual event, September 9-10, 2020, Revised Selected Papers
- Responsibility
- Christos Kaklamanis, Asaf Levin (eds.).
- Digital
- text file
- Imprint
- Cham : Springer, 2021.
- Physical description
- 1 online resource
- Series
- Lecture notes in computer science ; 12806.
- LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Online
Available online
More options
Description
Creators/Contributors
- Meeting
- WAOA (Workshop) (18th : 2020 : Online)
- Contributor
- Kaklamanis, Christos.
- Levin, Asaf.
Contents/Summary
- Contents
-
- 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.
- (source: Nielsen Book Data)
- Publisher's summary
-
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.
(source: Nielsen Book Data)
Subjects
Bibliographic information
- Publication date
- 2021
- Title variation
- WAOA 2020
- Series
- Lecture notes in computer science ; 12806
- LNCS sublibrary, SL 1, Theoretical computer science and general issues
- Note
- To Close Is Easier Than To Open: Dual Parameterization To k-Median.
- Includes author index.
- ISBN
- 9783030808792 (electronic bk.)
- 3030808793 (electronic bk.)
- 9783030808785
- 3030808785
- DOI
- 10.1007/978-3-030-80879-2
Browse related items
Start at call number:
