Muutke küpsiste eelistusi

Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 89, 2022, Proceedings 1st ed. 2022 [Pehme köide]

  • Formaat: Paperback / softback, 255 pages, kõrgus x laius: 235x155 mm, kaal: 415 g, 19 Illustrations, color; 15 Illustrations, black and white; XI, 255 p. 34 illus., 19 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13538
  • Ilmumisaeg: 21-Oct-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031183665
  • ISBN-13: 9783031183669
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 255 pages, kõrgus x laius: 235x155 mm, kaal: 415 g, 19 Illustrations, color; 15 Illustrations, black and white; XI, 255 p. 34 illus., 19 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13538
  • Ilmumisaeg: 21-Oct-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031183665
  • ISBN-13: 9783031183669
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.
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.