000 03788nam a22005775i 4500
001 978-3-642-33090-2
003 DE-He213
005 20140220083326.0
007 cr nn 008mamaa
008 120828s2012 gw | s |||| 0|eng d
020 _a9783642330902
_9978-3-642-33090-2
024 7 _a10.1007/978-3-642-33090-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aEpstein, Leah.
_eeditor.
245 1 0 _aAlgorithms – ESA 2012
_h[electronic resource] :
_b20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings /
_cedited by Leah Epstein, Paolo Ferragina.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXX, 839 p. 147 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7501
505 0 _aAlgorithm engineering -- algorithmic aspects of networks -- algorithmic game theory -- approximation algorithms -- computational biology -- computational finance -- computational geometry -- combinatorial optimization -- data compression -- data structures.-databases and information retrieval -- distributed and parallel computing -- graph algorithms -- hierarchical memories -- heuristics and meta-heuristics -- mathematical programming -- mobile computing -- on-line algorithms -- parameterized complexity -- pattern matching, quantum computing -- randomized algorithms -- scheduling and resource allocation problems -- streaming algorithms.
520 _aThis book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aNumeric Computing.
650 2 4 _aData Structures.
700 1 _aFerragina, Paolo.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642330896
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7501
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-33090-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c103581
_d103581