*************************************************************** 6th ADiMMO Workshop Trier (Germany) March 15-16, 2001 *************************************************************** Topics: - Algorithmic Discrete Mathematics - Combinatorics, Geometry, and Computation - Mathematical Optimization Registration and other information: Martin Mundhenk (mundhenk@ti.uni-trier.de) Preliminary Program: Thursday, March 15 9:00 - 10:00 Martin Grötschel (ZIB Berlin): The TSP and its Variants: What's New ? ------------------------------------------------------------ 10:15 - 11:45 Andreas Fest (TU Berlin): Ordering Variables in Project Scheduling Martin Mundhenk (Trier): Hardness of Planning Andreas Brieden (Muenchen): On the Inapproximability of Polynomial Programming -------------------------------------------------------------------------- 13:30 - 14:30 Susanne Albers (Dortmund): Caching in Large Networks ------------------------------------------------------------ 15:00 - 16:00 Harald Sack (Trier): tba Csaba Toth (FU Berlin/ETH Zuerich): Illuminating simple polygons with vertex $\pi$-floodlights ------------------------------------------------------------ 16:30 - 17:30 Günter Rote (FU Berlin): Integer Programming in Two Variables -------------------------------------------------------------------------- -------------------------------------------------------------------------- Friday, March 16 9:00 - 10:00 Peter Gritzmann (Muenchen): Discrete Inverse Problems: Battleship, Data Security and Tomography ------------------------------------------------------------ 10:15 - 11:45 Rustam Mubarakzjanov (Trier): tba Shi Lingsheng (HU Berlin): A Bound for Ramsey-Numbers Sven de Vries (Muenchen): tba -------------------------------------------------------------------------- 13:30 - 14:30 Wolfgang Paul (Saarbruecken): Formal Verification of Processors ------------------------------------------------------------ 15:00 - 16:00 Stefan Näher (Trier): tba ------------------------------------------------------------