Algorithms and Experiments (ALEX98)
Building bridges between theory and applications
Trento, Italy, February 9 - 11, 1998
Conference Proceedings
The Gzip-ped PostScript files of the final version of all
accepted papers are listed
in this directory.
The tar-ed version of the entire book is available
(all.tar, 3 Mbyte ) .
After retrieving the file and executing tar xvf all.tar one
creates a directory ./book containing all (gzipped) papers
and the introduction.
Introduction, index and ALEX98 figures
(index.ps.gz, 1.3 Mbyte )
Papers:
- Covering Trains by Stations or The Power of Data Reduction
,
Karsten Weihe
weihe.ps.gz
- Fast Address Look-Up for Internet Routers
,
Stefan Nilsson and Gunnar Karlsson
fast-lookup.ps.gz
- Bandwidth and Profile Reduction of Sparse Matrices: an Experimental
Comparison of New Heuristics,
Alessandra Esposito, Federico Malucelli, Luciano Tarricone
maluc.ps.gz
-
Compression of Sparse Matrices: Achieving Almost Minimal Table Sizes
,
Nicola Galli, Bernhard Seybold and Klaus Simon
galli.ps.gz
-
Experimental Performance of Shared RSA Modulus Generation
,
Sara Spalding and Rebecca N. Wright
rwright.ps.gz
-
The One-Dimensional Cutting Stock Problem: a Linear Programming
Algorithm Based on Hyperflows,
Maddalena Nonato, Maria Grazia Scutellà
nonato.ps.gz
-
Efficient Algorithms and Codes for k-Cardinality Assignment Problems
,
Mauro Dell'Amico, Andrea Lodi, Silvano Martello
alodi.ps.gz
- Transitive Closure Algorithm MEMTC and its Performance Analysis
,
Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen
hirvisalo.ps.gz
- The Disk-Covering Method for Tree Reconstruction
,
Daniel Huson, Scott Nettles, Laxmi Parida, Tandy Warnow and Shibu
Yooseph
huson.ps.gz
- A Seed-Growth Heuristic for Graph Bisection
,
Joe Marks, Wheeler Ruml, Stuart M. Shieber and J. Thomas Ngo
marks.ps.gz
- A Dynamic Programming Approach for Timing and Designing Clique
Algorithms,
Wendy Myrvold, Tania Prsa, Neil Walker
clique.ps.gz
- Experimenting an Approximation Algorithm for the LCS
,
P. Bonizzoni, M. D'Alessandro, G. Della Vedova and G. Mauri
Lcsexp.ps.gz
- Unbounded Knapsack Problem: New Results
,
Vincent Poirriez and Rumen Andonov
poirando.ps.gz
- Approximation Heuristics and Benchmarkings for the MinLA Problem
,
Jordi Petit i Silvestre
jpetit.ps.gz
- A Software Library of Dynamic Graph Algorithms
,
David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Nanni, Christos D. Zaroliagis
alberts.ps.gz
- An Approximation Algorithm for the Maximum Cut Problem and its
Experimental Analysis
,
A. Bertoni, P. Campadelli and G. Grossi
bertoni.ps.gz
- Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree
Problem
,
Martin Zachariasen, Pawel Winter
martinz.ps.gz
- Designing Algorithms by Sampling,
Mark K. Goldberg, David L. Hollinger
goldberg.ps.gz
- Make It! --- Generating and Maintaining Makefiles Automatically
,
Sven Schönherr and Alexander Wolff
sven.ps.gz
- On Very Large Maximum Clique Problems,
J. Abello, P. M. Pardalos and M. G. C. Resende
resende.ps.gz
- JAZ: Java Algorithm visualiZer. A Multi-Platform Collaborative Tool for
Teaching and Testing Graph Algorithms
,
Giancarlo Bongiovanni, Pierluigi Crescenzi,
Gabriella Rago
piluc.ps.gz
Back to ALEX98 home page.