Vai al contenuto principale della pagina
Titolo: | Algorithms -- ESA 2011 [[electronic resource] ] : 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011, Proceedings / / edited by Camil Demetrescu, Magnus M. Halldorsson |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Edizione: | 1st ed. 2011. |
Descrizione fisica: | 1 online resource (XIX, 813 p.) |
Disciplina: | 005.1 |
Soggetto topico: | 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 | |
Persona (resp. second.): | DemetrescuCamil |
HalldorssonMagnus M | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Sommario/riassunto: | 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. |
Titolo autorizzato: | Algorithms -- ESA 2011 |
ISBN: | 3-642-23719-3 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466023103316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |