Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10138)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WAOA 2016.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (16 papers)
-
Front Matter
-
Back Matter
Other volumes
-
Approximation and Online Algorithms
Keywords
- balanced optimization
- computational complexity
- online algorithms
- probability
- robust optimization
- algorithms
- assignment problem
- coloring
- competitive ratio
- correlation clustering
- general assignment
- graph approximation
- graph sparsification
- lower bound
- optimization
- packing and covering
- planar graphs
- shortest separating cycle
- traveling salesman problem
- trees
- algorithm analysis and problem complexity
About this book
This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016.
The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems.
Editors and Affiliations
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers
Editors: Klaus Jansen, Monaldo Mastrolilli
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-51741-4
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-51740-7Published: 07 January 2017
eBook ISBN: 978-3-319-51741-4Published: 06 January 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 211
Number of Illustrations: 23 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures, Algorithms, Numeric Computing