ENGLISH

Algorithm Engineering and Experimentation: Third International Workshop, ALENEX 2001 Washington, DC, USA, January 5–6, 2001 Revised Papers

By Adam L. Buchsbaum , Sándor P. Fekete , Henk Meijer , André Rohe , Walter Tietze (auth.) , Jack Snoeyink (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42560-1, 978-3-540-44808-2, 3-540-42560-8
DOI
10.1007/3-540-44808-X
Language
english
Format
PDF
Filesize
5 MB (5231446 bytes)
Series
Lecture Notes in Computer Science 2153
Edition
1
Pages
236\239
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Data St

Description

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001, held in Washington, DC, USA in January 2001. The 15 revised full papers presented together with the abstracts of three invited presentations have gone through two rounds of reviewing and revision and were selected from 31 submissions. Among the topics addressed are heuristics for approximation, network optimization, TSP, randomization, sorting, information retrieval, graph computations, tree clustering, scheduling, network algorithms, point set computations, searching, and data mining.

Similar books