Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 13538)
Included in the following conference series:
Conference proceedings info: WAOA 2022.
Buy print copy
About this book
The 12 papers included in these proceedings were carefully reviewed and selected from
21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc.
Similar content being viewed by others
Keywords
- approximation algorithms
- combinatorial optimization
- computer networks
- graph theory
- correlation analysis
- online algorithms
- graph algorithms and analysis
- adaptive algorithms
- scheduling algorithms
- streaming algorithms
- stochastic approximation
- theoretical computer science
- approximation theory
- competitive ratio
- graphic methods
- mathematics
- numerical model
- on-line algorithms
- polynomial approximation
- probability
Table of contents (12 papers)
Other volumes
-
Approximation and Online Algorithms
Editors and Affiliations
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings
Editors: Parinya Chalermsook, Bundit Laekhanukit
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-031-18367-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
Softcover ISBN: 978-3-031-18366-9Published: 21 October 2022
eBook ISBN: 978-3-031-18367-6Published: 20 October 2022
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 255
Number of Illustrations: 15 b/w illustrations, 19 illustrations in colour
Topics: Computational Mathematics and Numerical Analysis, Data Structures and Information Theory, Discrete Mathematics in Computer Science, Numerical Analysis, Symbolic and Algebraic Manipulation, Algorithm Analysis and Problem Complexity