Format:
1 Online-Ressource (XII, 253 p. 44 illus., 25 illus. in color)
ISBN:
9783030394790
Series Statement:
Lecture Notes in Computer Science 11926
Content:
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
Content:
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.
Additional Edition:
ISBN 9783030394783
Additional Edition:
ISBN 9783030394806
Additional Edition:
Erscheint auch als Druck-Ausgabe WAOA (17. : 2019 : München) Approximation and online algorithms Cham, Switzerland : Springer Nature, 2020 ISBN 9783030394783
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783030394806
Language:
English
Keywords:
Approximation
;
Komplexitätstheorie
;
Reihenfolgeproblem
;
Konferenzschrift
DOI:
10.1007/978-3-030-39479-0
Author information:
Megow, Nicole
Bookmarklink
