1 option
Approximation and Online Algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers / edited by Roberto Solis-Oba, Rudolf Fleischer.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 10787
- Theoretical Computer Science and General Issues, 2512-2029 ; 10787
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Numerical analysis.
- Artificial intelligence-Data processing.
- Computer networks.
- Computer graphics.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Data Science.
- Computer Communication Networks.
- Computer Graphics.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Numerical Analysis.
- Data Science.
- Computer Communication Networks.
- Computer Graphics.
- Physical Description:
- 1 online resource (X, 329 pages) : 42 illustrations
- Edition:
- 1st ed. 2018.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2018.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
- Contents:
- 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
- Coloring and partitioning
- Competitive analysis
- Computational advertising
- Computational finance
- Cuts and connectivity
- Geometric problems
- Mechanism design
- Resource augmentation
- Real-world applications.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-89441-6
- 9783319894416
- 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.