04508nam 22008055 450 99646555750331620230223122227.03-642-33090-810.1007/978-3-642-33090-2(CKB)3400000000085707(SSID)ssj0000745825(PQKBManifestationID)11930863(PQKBTitleCode)TC0000745825(PQKBWorkID)10859494(PQKB)10769641(DE-He213)978-3-642-33090-2(MiAaPQ)EBC3070945(PPN)168323508(EXLCZ)99340000000008570720120828d2012 u| 0engurnn#008mamaatxtccrAlgorithms –- ESA 2012[electronic resource] 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings /edited by Leah Epstein, Paolo Ferragina1st ed. 2012.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2012.1 online resource (XX, 839 p. 147 illus.)Theoretical Computer Science and General Issues,2512-2029 ;7501Bibliographic Level Mode of Issuance: Monograph3-642-33089-4 Includes bibliographical references and index.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 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.Theoretical Computer Science and General Issues,2512-2029 ;7501AlgorithmsComputer 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.7/3Epstein Leahedthttp://id.loc.gov/vocabulary/relators/edtFerragina Paoloedthttp://id.loc.gov/vocabulary/relators/edtESA (Symposium)BOOK996465557503316Algorithms –- ESA 20122832073UNISA