Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8952)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): WAOA: International Workshop on Approximation and Online Algorithms
Conference proceedings info: WAOA 2014.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (22 papers)
-
Front Matter
About this book
This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014.
The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as 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.
Keywords
- Approximation algorithms
- Coloring
- Competitive analysis
- Connectivity
- Design and analysis of algorithms
- Geometric problems
- Graph algorithms analysis
- Graph drawing
- Network design
- Online algorithms
- Online problems
- Operations research
- Packing and covering
- Parameterized complexity
- Partitioning
- Randomization techniques
- Scheduling problems
- algorithm analysis and problem complexity
Editors and Affiliations
-
Université Pierre et Marie Curie, LIP6, Paris, France
Evripidis Bampis
-
EPFL-IC, Lausanne, Switzerland
Ola Svensson
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers
Editors: Evripidis Bampis, Ola Svensson
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-18263-6
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-18262-9Published: 04 May 2015
eBook ISBN: 978-3-319-18263-6Published: 22 April 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 273
Number of Illustrations: 29 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Algorithms