Proceedings of
2nd Workshop on Algorithm Engineering and Experiments
ALENEX 00
January 7-8, 2000, San Francisco
This is a preliminary version of the proceedings, corresponding
to the printed preliminary proceedings that will be given to
workshop participants.
Please note that most of the files below are quite large. You may prefer
to download instead the gzipped tar-ed file comprising these 16 files,
here -- this is a 3.7M file, actually
shorter than some of the uncompressed files below.
-
(6 pages) Introduction and table of contents
-
(14 pages) A network-flow-based scheduler: design,
performance history, and experimental analysis, H. Gabow and T. Kohno
-
(14 pages) Caching and scheduling for broadcast disk systems,
V. Liberatore
-
(14 pages) Force-directed methods for mesh improvement,
H. Djidjev
-
(16 pages) Protecting critical facets in layered manufacturing: implementation and experimental results,
J. Schwerdt, M. Smid, R. Janardan, and E. Johnson
-
(20 pages) An experimental study of polylogarithmic fully-dynamic
connectivity algorithms,
R. Iyer, D. Karger, H. Rahul, and M. Thorup
-
(14 pages) Experimental study of a solution method for
the multicommodity flow problem,
T. Radzik
-
(14 pages) Experiments on curve reconstruction,
E. Althaus, K. Mehlhorn, S. Naeher, and S. Schirra
-
(16 pages) An improved randomized selection algorithm
with an experimental study,
David Bader
-
(16 pages) Adapting radix sort to the memory hierarchy,
Naila Rahman and Rajeev Raman
-
(10 pages) A learning algorithm for the longest common subsequence problem,
E. Breimer, Mark Goldberg, and D. Lim
-
(14 pages) Algorithms and experiments on transitive closure, path cover,
and multiple sequence alignment,
S. Abdeddaim
-
(12 pages) Break the "right" cycles and get the "best" drawing,
C. Demetrescu and I. Finocchi
-
(14 pages) Experiments with computing geometric minimum spanning trees,
G. Narasimhan, M. Zachariasen, and J. Zhu
-
(20 pages) General-purpose spatial decomposition algorithms:
experimental results,
S. Tate and K. Xu
-
(20 pages) I/O-efficient algorithms for problems on grid-based terrains,
Lars Arge, L. Toma, and Jeff Vitter