Library of American University of Madaba
Your cart is empty.
Jansen, Klaus.
Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers / [electronic resource] : edited by Klaus Jansen, Roberto Solis-Oba. - X, 273p. online resource. - Lecture Notes in Computer Science, 6534 0302-9743 ; .
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, mechanism 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.
9783642183188
Computer science.
Computer software.
Electronic data processing.
Computational complexity.
Information systems.
Computer graphics.
Algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Numeric Computing.
Computer Graphics.
Information Systems Applications (incl.Internet).
Algorithms.
QA76.9.A43
005.1
Approximation and Online Algorithms 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers / [electronic resource] : edited by Klaus Jansen, Roberto Solis-Oba. - X, 273p. online resource. - Lecture Notes in Computer Science, 6534 0302-9743 ; .
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, mechanism 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.
9783642183188
Computer science.
Computer software.
Electronic data processing.
Computational complexity.
Information systems.
Computer graphics.
Algorithms.
Computer Science.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Numeric Computing.
Computer Graphics.
Information Systems Applications (incl.Internet).
Algorithms.
QA76.9.A43
005.1