Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10787)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WAOA 2017.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
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.
Similar content being viewed by others
Keywords
- Approximation algorithms
- online algorithms
- combinatorial optimization
- networks
- game theory
- scheduling
- packing and covering
- graph theory
- approximation algorithms
- graphic methods
- telecommunication networks
- artificial intelligence
- cluster analysis
- clustering
- bin packing
- planar graph
- directed graphs
- randomized algorithms
- nash equilibrium
- algorithm analysis and problem complexity
- data structures
Table of contents (23 papers)
-
Front Matter
Other volumes
-
Approximation and Online Algorithms
Editors and Affiliations
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers
Editors: Roberto Solis-Oba, Rudolf Fleischer
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-89441-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG, part of Springer Nature 2018
Softcover ISBN: 978-3-319-89440-9Published: 01 April 2018
eBook ISBN: 978-3-319-89441-6Published: 19 April 2018
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 329
Number of Illustrations: 42 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Data Structures, Computer Communication Networks, Computer Graphics