|
|
|
|
| LEADER |
03028nam a22005415i 4500 |
| 001 |
978-3-642-29116-6 |
| 003 |
DE-He213 |
| 005 |
20151204190020.0 |
| 007 |
cr nn 008mamaa |
| 008 |
120326s2012 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642291166
|9 978-3-642-29116-6
|
| 024 |
7 |
|
|a 10.1007/978-3-642-29116-6
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Approximation and Online Algorithms
|h [electronic resource] :
|b 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers /
|c edited by Roberto Solis-Oba, Giuseppe Persiano.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2012.
|
| 300 |
|
|
|a X, 278 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7164
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: 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 and scheduling problems.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 650 |
2 |
4 |
|a Information Systems Applications (incl. Internet).
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 700 |
1 |
|
|a Solis-Oba, Roberto.
|e editor.
|
| 700 |
1 |
|
|a Persiano, Giuseppe.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642291159
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7164
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-29116-6
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
