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

by Leah Epstein (Editor), Paolo Ferragina (Editor)

Overview

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.

Product Details

ISBN-13:	9783642330896
Publisher:	Springer Berlin Heidelberg
Publication date:	08/02/2012
Series:	Lecture Notes in Computer Science , #7501
Edition description:	2012
Pages:	839
Product dimensions:	6.10(w) x 9.25(h) x 0.07(d)

Table of Contents

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.