04515nam 22007815 450 991048502570332120230406055538.03-642-40450-210.1007/978-3-642-40450-4(CKB)3710000000015925(SSID)ssj0000988027(PQKBManifestationID)11552037(PQKBTitleCode)TC0000988027(PQKBWorkID)10949986(PQKB)11169498(DE-He213)978-3-642-40450-4(MiAaPQ)EBC3093592(PPN)17242948X(EXLCZ)99371000000001592520130816d2013 u| 0engurnn#008mamaatxtccrAlgorithms – ESA 2013[electronic resource] 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings /edited by Hans L. Bodlaender, Giuseppe F. Italiano1st ed. 2013.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2013.1 online resource (XVIII, 829 p. 134 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8125Bibliographic Level Mode of Issuance: Monograph3-642-40449-9 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.This 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.Theoretical Computer Science and General Issues,2512-2029 ;8125AlgorithmsComputer networksComputer science—MathematicsDiscrete mathematicsComputer graphicsNumerical analysisArtificial intelligence—Data processingAlgorithmsComputer Communication NetworksDiscrete Mathematics in Computer ScienceComputer GraphicsNumerical AnalysisData ScienceAlgorithms.Computer networks.Computer science—Mathematics.Discrete mathematics.Computer graphics.Numerical analysis.Artificial intelligence—Data processing.Algorithms.Computer Communication Networks.Discrete Mathematics in Computer Science.Computer Graphics.Numerical Analysis.Data Science.005.1Bodlaender Hans Ledthttp://id.loc.gov/vocabulary/relators/edtItaliano Giuseppe Fedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910485025703321Algorithms – ESA 20132831118UNINA