TY - BOOK
AU - Bodlaender,Hans L.
AU - Italiano,Giuseppe F.
ED - SpringerLink (Online service)
TI - Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings
T2 - Lecture Notes in Computer Science,
SN - 9783642404504
AV - QA76.9.A43
U1 - 005.1 23
PY - 2013///
CY - Berlin, Heidelberg
PB - Springer Berlin Heidelberg, Imprint: Springer
KW - Computer science
KW - Computer communication systems
KW - Data structures (Computer science)
KW - Algorithms
KW - Numerical analysis
KW - Mathematics
KW - Computer graphics
KW - Computer Science
KW - Algorithm Analysis and Problem Complexity
KW - Computer Communication Networks
KW - Discrete Mathematics in Computer Science
KW - Computer Graphics
KW - Numeric Computing
KW - Data Structures
N1 - 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
N2 - 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
UR - http://dx.doi.org/10.1007/978-3-642-40450-4
ER -