Muutke küpsiste eelistusi

E-raamat: Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830311836762e.html
Märksõnad: