Overview
- High quality selected papers
- Unique visibility
- State of the art research
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6534)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: WAOA 2010.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (23 papers)
-
WAOA 2010
Other volumes
-
Approximation and Online Algorithms
Keywords
- algorithm analysis
- algorithm design
- algorithmic graph theory
- approximation algorithm
- chordal graph
- combinatorial optimization
- competitive analysis
- complexity
- disk graph
- domination search
- dynamic flow
- edge-connectivity
- efficiency
- exponential distribution
- game theory
- graph algorithms
- graph minors
- graphs
- inapproximability
- intersection graph
About this book
This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.
The 23 revised full papers presented were carefully reviewed and
selected from 58 submissions. The workshop covered areas such as
algorithmic game theory, approximation classes, coloring and
partitioning, competitive analysis, computational finance, cuts and
connectivity, geometric problems, inapproximability results, echanism
design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized
complexity, randomization techniques, real-world applications, and
scheduling problems.
Editors and Affiliations
Bibliographic Information
Book Title: Approximation and Online Algorithms
Book Subtitle: 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers
Editors: Klaus Jansen, Roberto Solis-Oba
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-18318-8
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-18317-1Published: 25 January 2011
eBook ISBN: 978-3-642-18318-8Published: 24 January 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 273
Number of Illustrations: 15 b/w illustrations, 3 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Computer Graphics, Information Systems Applications (incl. Internet), Algorithms
Industry Sectors: Aerospace, Biotechnology, Electronics, Energy, Utilities & Environment, IT & Software, Telecommunications