|
|
|
|
| LEADER |
02866nam a22005655i 4500 |
| 001 |
978-3-642-23719-5 |
| 003 |
DE-He213 |
| 005 |
20151204140907.0 |
| 007 |
cr nn 008mamaa |
| 008 |
110830s2011 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642237195
|9 978-3-642-23719-5
|
| 024 |
7 |
|
|a 10.1007/978-3-642-23719-5
|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 Algorithms – ESA 2011
|h [electronic resource] :
|b 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings /
|c edited by Camil Demetrescu, Magnús M. Halldórsson.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2011.
|
| 300 |
|
|
|a XIX, 813 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 6942
|
| 520 |
|
|
|a This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Data structures (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 Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 700 |
1 |
|
|a Demetrescu, Camil.
|e editor.
|
| 700 |
1 |
|
|a Halldórsson, Magnús M.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642237188
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6942
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-23719-5
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
