Algorithms -- ESA 2011 [electronic resource] : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings / edited by Camil Demetrescu, Magnus M. Halldorsson.
Contributor(s): Demetrescu, Camil [editor.]
| Halldorsson, Magnus M [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6942Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XIX, 813 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642237195.Subject(s): Algorithms | 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 ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.