1 option
Approximation and Online Algorithms : 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers / edited by Christos Kaklamanis, Asaf Levin.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12806
- Theoretical Computer Science and General Issues, 2512-2029 ; 12806
- Language:
- English
- Subjects (All):
- 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.
- Local Subjects:
- Algorithms.
- Symbolic and Algebraic Manipulation.
- Discrete Mathematics in Computer Science.
- Data Structures and Information Theory.
- Theory of Computation.
- Computer and Information Systems Applications.
- Physical Description:
- 1 online resource (XII, 237 pages) : 31 illustrations, 9 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-80879-2
- 9783030808792
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.