Algorithms – ESA 2013 [electronic resource] :21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings /
Contributor(s): Bodlaender, Hans L [editor.] | Italiano, Giuseppe F [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 8125Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.Description: XVIII, 829 p. 134 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642404504.Subject(s): Computer science | Computer communication systems | Data structures (Computer science) | Algorithms | Numerical analysis | Computer science -- Mathematics | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Discrete Mathematics in Computer Science | Computer Graphics | Numeric Computing | Data StructuresOnline resources: Click here to access online
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.