Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings de Parinya Chalermsook

Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13538

Editat de Parinya Chalermsook, Bundit Laekhanukit
en Limba Engleză Paperback – 21 oct 2022
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37561 lei

Nou

Puncte Express: 563
Preț estimativ în valută:
7189€ • 7493$ • 5985£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031183669
ISBN-10: 3031183665
Pagini: 255
Ilustrații: XI, 255 p. 34 illus., 19 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.38 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.