ENGLISH

Algorithms – ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings

By Akiyoshi Shioura (auth.) , Camil Demetrescu , Magnús M. Halldórsson (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2011
ISBN
9783642237195, 3642237193
DOI
10.1007/978-3-642-23719-5
Language
english
Format
PDF
Filesize
10 MB (10635530 bytes)
Series
Lecture Notes in Computer Science 6942 Theoretical Computer Science and General Issues
Edition
1
Pages
813\832
Time added
2013-04-24 17:00:00
Algorithm Analysis and Problem Complexity; Compute

Description

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.

Similar books