Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9499)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WAOA 2015.
Buy print copy
About this book
This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.
The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
Similar content being viewed by others
Keywords
- Algorithm analysis
- Competitive analysis
- Geometric problems
- Parameterized complexity
- Temporal graphs
- Algorithms
- Approximation algorithms
- Coloring
- Design and analysis of algorithms
- Discrete mathematics in computer science
- Fixed-parameter tractable algorithm
- Network design
- Numeric computing
- Online algorithms
- Online scheduling
- Packing and covering
- Problem complexity
- Random input
- Randomization techniques
- Temporal connectivity
- algorithm analysis and problem complexity
Table of contents (17 papers)
Other volumes
-
Approximation and Online Algorithms
Editors and Affiliations
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
Editors: Laura Sanità, Martin Skutella
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-28684-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-28683-9Published: 03 February 2016
eBook ISBN: 978-3-319-28684-6Published: 12 January 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 209
Number of Illustrations: 24 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Data Structures, Algorithms, Computation by Abstract Devices, Numeric Computing