Algorithms – ESA 2011
19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings
Demetrescu, Camil.
editor.
Halldórsson, Magnús M.
editor.
SpringerLink (Online service)
text
gw
2011
monographic
eng
access
XIX, 813 p. online resource.
This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.
edited by Camil Demetrescu, Magnús M. Halldórsson.
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 Structures
QA76.9.A43
005.1
Springer eBooks
Lecture Notes in Computer Science, 6942
9783642237195
http://dx.doi.org/10.1007/978-3-642-23719-5
http://dx.doi.org/10.1007/978-3-642-23719-5
110830
20170515111756.0
978-3-642-23719-5