Muutke küpsiste eelistusi

E-raamat: Approximation and Online Algorithms: 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - EPUB+DRM
  • Hind: 61,74 €*
  • * 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: 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024, 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 the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 56, 2024. 





The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.
.- Bounding the price-of-fair-sharing using knapsack-cover constraints
to guide near-optimal cost-recovery algorithms.



.- Improved online scheduling with restarts on a single machine.



.- Searching in Euclidean Spaces with Predictions.



.- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths..



.- Approximating delta-Covering.



.- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect
Matching.



.- Approximation Algorithms for k-Scenario Matching.



.- Tight Approximation Bounds on a Simple Algorithm for Minimum Average
Search Time in Trees.



.- Online Deterministic Minimum Cost Bipartite Matching with Delays on a
Line.



.- Maximizing Throughput for Parallel Jobs with Speed-up Curves.



.- Improved approximation algorithms for covering pliable set families and
flexible graph connectivity.



.- Small additive error for unsplittable multicommodity flow in outerplanar
graphs.



.- Complexity of Fixed Order Routing.



.- Approximate Min-Sum Subset Convolution.



.- Online String Attractors.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97830318139626e.html