Approximation and Online Algorithms [[electronic resource] ] : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Approximation and Online Algorithms [[electronic resource] ] : 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers / / edited by Christos Kaklamanis, Asaf Levin
|
| Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Edizione: | 1st ed. 2021. |
| Descrizione fisica: | 1 online resource (247 pages) |
| Disciplina: | 005.1 |
| Soggetto topico: | Algorithms |
| Computer science - Mathematics | |
| Discrete mathematics | |
| Data structures (Computer science) | |
| Information theory | |
| Computer science | |
| Application software | |
| Symbolic and Algebraic Manipulation | |
| Discrete Mathematics in Computer Science | |
| Data Structures and Information Theory | |
| Theory of Computation | |
| Computer and Information Systems Applications | |
| Algorismes en línia | |
| Optimització matemàtica | |
| Soggetto genere / forma: | Congressos |
| Llibres electrònics | |
| Persona (resp. second.): | KaklamanisChristos |
| LeṿinAsaf | |
| Nota di contenuto: | Design and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques. |
| Sommario/riassunto: | This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 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, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. |
| Titolo autorizzato: | Approximation and Online Algorithms |
| ISBN: | 3-030-80879-3 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910490024503321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 12806