Approximation and Online Algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings / edited by Parinya Chalermsook, Bundit Laekhanukit.

Format:

Book

Contributor:

Chalermsook, Parinya, editor.

Laekhanukit, Bundit, editor.

Series:

Lecture Notes in Computer Science, 1611-3349 ; 13538

Language:

English

Subjects (All):

Mathematics--Data processing.

Mathematics.

Data structures (Computer science).

Information theory.

Computer science--Mathematics.

Computer science.

Discrete mathematics.

Numerical analysis.

Algorithms.

Computational Mathematics and Numerical Analysis.

Data Structures and Information Theory.

Discrete Mathematics in Computer Science.

Numerical Analysis.

Symbolic and Algebraic Manipulation.

Design and Analysis of Algorithms.

Local Subjects:

Computational Mathematics and Numerical Analysis.

Data Structures and Information Theory.

Discrete Mathematics in Computer Science.

Numerical Analysis.

Symbolic and Algebraic Manipulation.

Design and Analysis of Algorithms.

Physical Description:

1 online resource (264 pages)

Edition:

1st ed. 2022.

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2022.

Summary:

This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022. The 12 papers included in these proceedings were carefully reviewed and selected from 21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.

Contents:

Locating Service and Charging stations

Graph burning and non-uniform $k$-centers for small treewidth

Scheduling with Machine Conflicts

Knapsack Secretary Through Boosting

Scheduling Appointments Online: The Power of Deferred Decision-Making

Canadian Traveller Problem with Predictions

The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride

Stochastic graph exploration with limited resources

Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem

On Streaming Algorithms for Geometric Independent Set and Clique

Approximating Length-Restricted Means under Dynamic Time Warping.

Notes:

Includes bibliographical references and index.

Other Format:

Print version: Chalermsook, Parinya Approximation and Online Algorithms

ISBN:

9783031183676

3031183673