Algorithms and Experiments (ALEX98)
Building bridges between theory and applications
Trento, Italy, February 9 - 11, 1998

Background material from invited speakers (in preparation)

• Invited talk: Peter Widmayer (ETH Zurich, Switzerland)
  "Distributed data structures - concepts and design choices"
• Invited talk: Rainer E. Burkard (Technische Universitaet Graz, Austria)
  "Fast algorithms for obnoxious location problems"
  • Abstract of the talk
  • Paper1 (gzipped PostScript)
  • Paper2 (gzipped PostScript)
• Invited talk: Panos Pardalos (University of Florida, USA)
  "Heuristics for Large Max Clique Problems Based on Continuous Approaches"
  • Abstract of the talk
• Invited talk: Prabhakar Raghavan (IBM Almaden, USA)
  "Mining information networks: the CLEVER project at IBM Almaden" "Fast algorithms for obnoxious location problems"
  • raghavan.ps.gz (copy of the slides)
  • html paper
• Invited talk: Catherine McGeoch (Amherst College, USA)
  "Open Problems in Experimental Analysis of Algorithms"
• Invited talk: Afonso Ferreira (CNRS, LIP-ENS, Lyon, France)
  "Discrete algorithms: practical and efficient, although parallel"
  • ferreira1.ps.gz (copy of relevant paper)
  • ferreira2.ps.gz (copy of relevant paper - tutorial )
  • ferreira3.ps.gz (copy of relevant paper)
• Invited talk: Silvano Martello (University of Bologna, Italy)
  "Two- and Three-Dimensional Bin Packing Problems"
  • 2dbpp_rf.ps (copy of relevant paper)
  • 3dbpp.ps (copy of relevant paper)
• Invited talk: Maurizio Bonuccelli (University of Pisa, Italy)
  "Packet Scheduling in Single-Hop Communication Systems"
  • (abstract of the talk)
  • boclo.ps.gz (relevant paper)
• Invited talk: Dorit Hochbaum (Berkeley, USA)
  "A new algorithm and a new simplex algorithm for the maximum flow problem based on an old algorithm for the open pit mining problem."
  • dorit.ps.gz (relevant paper)