Pensum -10%
Approximation and Online Algorithms
Klaus Jansen, Monaldo Mastrolilli
PocketEngelsk
Del av serien Lecture Notes in Computer Science
Hopp til hovedinnholdet
Approximation and Online Algorithms
Redigert av Evripidis Bampis, Nicole Megow, 2020.Del av serien Lecture Notes in Computer Science.
17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers
This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
PocketEngelsk
Normalpris: 679,-
611,-
Spar 68,-
Laveste pris siste 30 dager: 519,-
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
Approximation and Online Algorithms
Redigert av Evripidis Bampis, Nicole Megow, 2020.Del av serien Lecture Notes in Computer Science.
17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers
This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Normalpris: 679,-
611,-
Spar 68,-
Laveste pris siste 30 dager: 519,-
PocketEngelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
611,-
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
