1 option
Algorithms -- ESA 2011 : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings / edited by Camil Demetrescu, Magnus M. Halldorsson.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 6942
- Theoretical Computer Science and General Issues, 2512-2029 ; 6942
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer networks.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer graphics.
- Numerical analysis.
- Artificial intelligence-Data processing.
- Computer Communication Networks.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Numerical Analysis.
- Data Science.
- Local Subjects:
- Algorithms.
- Computer Communication Networks.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Numerical Analysis.
- Data Science.
- Physical Description:
- 1 online resource (XIX, 813 pages)
- Edition:
- 1st ed. 2011.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
- System Details:
- text file PDF
- Summary:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-23719-5
- 9783642237195
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.