|
|
|
|
LEADER |
02214nmm a2200373 u 4500 |
001 |
EB000386104 |
003 |
EBX01000000000000000239156 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783642183188
|
100 |
1 |
|
|a Jansen, Klaus
|e [editor]
|
245 |
0 |
0 |
|a Approximation and Online Algorithms
|h Elektronische Ressource
|b 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010, Revised Papers
|c edited by Klaus Jansen, Roberto Solis-Oba
|
250 |
|
|
|a 1st ed. 2011
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2011, 2011
|
300 |
|
|
|a X, 273 p. 18 illus., 3 illus. in color
|b online resource
|
653 |
|
|
|a Computer science—Mathematics
|
653 |
|
|
|a Computer graphics
|
653 |
|
|
|a Numerical Analysis
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Computer Graphics
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Application software
|
653 |
|
|
|a Numerical analysis
|
653 |
|
|
|a Discrete mathematics
|
653 |
|
|
|a Computer and Information Systems Applications
|
700 |
1 |
|
|a Solis-Oba, Roberto
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/978-3-642-18318-8
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-18318-8?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 518.1
|
520 |
|
|
|a 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
|