|
|
|
|
LEADER |
02822nam a22005655i 4500 |
001 |
10597 |
003 |
DE-He213 |
005 |
20130725200055.0 |
007 |
cr nn 008mamaa |
008 |
100509s2010 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642124501
|9 978-3-642-12450-1
|
024 |
7 |
# |
|a 10.1007/978-3-642-12450-1
|2 doi
|
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
|
100 |
1 |
# |
|a Bampis, Evripidis.
|e editor.
|
245 |
1 |
0 |
|a Approximation and Online Algorithms
|b 7th International Workshop,WAOA 2009, Copenhagen Denmark, September 10-11, 2009. Revised Papers /
|c edited by Evripidis Bampis, Klaus Jansen.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
# |
# |
|a X, 255p.
|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,
|v 5893
|x 0302-9743 ;
|
520 |
# |
# |
|a This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 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.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Data structures (Computer science).
|
650 |
# |
0 |
|a Computer software.
|
650 |
# |
0 |
|a Electronic data processing.
|
650 |
# |
0 |
|a Computational complexity.
|
650 |
# |
0 |
|a Computer graphics.
|
650 |
# |
0 |
|a Algorithms.
|
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 Data Structures.
|
650 |
2 |
4 |
|a Algorithms.
|
700 |
1 |
# |
|a Jansen, Klaus.
|e editor.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642124495
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5893
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-12450-1
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|