000 04095nam a22005895i 4500
001 vtls000485269
003 RU-ToGU
005 20210922065832.0
007 cr nn 008mamaa
008 140715s2013 gw | s |||| 0|eng d
020 _a9783642404504
_9978-3-642-40450-4
024 7 _a10.1007/978-3-642-40450-4
_2doi
035 _ato000485269
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aBodlaender, Hans L.
_eeditor.
_9325664
245 1 0 _aAlgorithms – ESA 2013
_h[electronic resource] :
_b21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings /
_cedited by Hans L. Bodlaender, Giuseppe F. Italiano.
260 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXVIII, 829 p. 134 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8125
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 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: 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.
_9155490
650 0 _aComputer Communication Networks.
_9566243
650 0 _aData structures (Computer science).
_9566232
650 0 _aComputer software.
_9303280
650 0 _aElectronic data processing.
_9303503
650 0 _aComputational complexity.
_9304814
650 0 _aComputer graphics.
_9281357
650 1 4 _aComputer Science.
_9155490
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_9303732
650 2 4 _aComputer Communication Networks.
_9566243
650 2 4 _aDiscrete Mathematics in Computer Science.
_9304816
650 2 4 _aComputer Graphics.
_9281357
650 2 4 _aNumeric Computing.
_9303733
650 2 4 _aData Structures.
_9303104
700 1 _aItaliano, Giuseppe F.
_eeditor.
_9322083
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-40450-4
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c356927