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. 
 - 1st ed. 2011. 
 - X, 273 p. 18 illus., 3 illus. in color.  online resource. 
 - Theoretical Computer Science and General Issues,  6534  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  6534 .
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9783642183188 
<br/><br/><label>Standard No.: </label>10.1007/978-3-642-18318-8  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Numerical analysis.<br/>Computer graphics.<br/>Application software.<br/>Algorithms.<br/>Discrete Mathematics in Computer Science.<br/>Numerical Analysis.<br/>Computer Graphics.<br/>Computer and Information Systems Applications.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43 
<br/><br/><label>Dewey Class. No.: </label>518.1