Pensum -10%
Approximation and Online Algorithms
Bundit Laekhanukit, Parinya Chalermsook
PocketEngelsk
Del av serien Lecture Notes in Computer Science
Hopp til hovedinnholdet
Approximation and Online Algorithms
Redigert av Andreas Wiese, Jarosław Byrka, 2023.Del av serien Lecture Notes in Computer Science.
21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023
The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were 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 the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems
PocketEngelsk
Normalpris: 749,-
674,-
Spar 75,-
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
Approximation and Online Algorithms
Redigert av Andreas Wiese, Jarosław Byrka, 2023.Del av serien Lecture Notes in Computer Science.
21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings
This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023
The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were 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 the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems
Normalpris: 749,-
674,-
Spar 75,-
PocketEngelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
674,-
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
