ENGLISH

Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

By Lars Arge (auth.) , Friedhelm Meyer auf der Heide (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42493-2, 978-3-540-44676-7, 3-540-42493-8
DOI
10.1007/3-540-44676-1
Language
english
Format
PDF
Filesize
6 MB (6123074 bytes)
Series
Lecture Notes in Computer Science 2161
Edition
1
Pages
544\550
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.

Similar books