| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996418220903316 |
|
|
Titolo |
Approximation and Online Algorithms [[electronic resource] ] : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / / edited by Evripidis Bampis, Nicole Megow |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2020.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 253 p. 44 illus., 25 illus. in color.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11926 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematics—Data processing |
Computer engineering |
Computer networks |
Application software |
Computer science |
Computer science—Mathematics |
Discrete mathematics |
Computational Mathematics and Numerical Analysis |
Computer Engineering and Networks |
Computer and Information Systems Applications |
Theory of Computation |
Discrete Mathematics in Computer Science |
Symbolic and Algebraic Manipulation |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
Graph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. . |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |