Algorithms –- ESA 2012 -

Algorithms –- ESA 2012

20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings

Leah Epstein, Paolo Ferragina (Herausgeber)

Buch | Softcover
XX, 839 Seiten
2012 | 2012
Springer Berlin (Verlag)
978-3-642-33089-6 (ISBN)
53,49 inkl. MwSt
This book constitutes the refereed proceedings of the 20th Annual European Symposium on Algorithms, ESA 2012, held in Ljubljana, Slovenia, in September 2012 in the context of the combined conference ALGO 2012. The 69 revised full papers presented were carefully reviewed and selected from 285 initial submissions: 56 out of 231 in track design and analysis and 13 out of 54 in track engineering and applications. The papers are organized in topical sections such as algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching, quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Algorithm engineering.- algorithmic aspects of networks.- algorithmic game theory.- approximation algorithms.- computational biology.- computational finance.- computational geometry.- combinatorial optimization.- data compression.- data structures.-databases and information retrieval.- distributed and parallel computing.- graph algorithms.- hierarchical memories.- heuristics and meta-heuristics.- mathematical programming.- mobile computing.- on-line algorithms.- parameterized complexity.- pattern matching, quantum computing.- randomized algorithms.- scheduling and resource allocation problems.- streaming algorithms.

Erscheint lt. Verlag 2.8.2012
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XX, 839 p. 147 illus.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 1274 g
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Schlagworte Algorithm analysis and problem complexity • anonymous network • data structures • Linear Programming • network design • online algorithms • symmetric multicast
ISBN-10 3-642-33089-4 / 3642330894
ISBN-13 978-3-642-33089-6 / 9783642330896
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
29,99
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
32,99