Technical reports 1999
-
Verteilte Verbindungssuche im öffentlichen Personenverkehr: Graphentheoretische Modelle und Algorithmen
-
Convex Quadratic Programming Relaxations for Network Scheduling Problems
-
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
-
Shelling Hexahedral Complexes for Mesh Generation
-
On the Discrete Core of Quadrilateral Mesh Refinement
- Karsten Weihe, Ulrik Brandes, Liebers, Annegret, Matthias Müller-Hannemann, Dorothea Wagner, and Thomas WillhalmEmpirical Design of Geometric Algorithms
-
The Power of alpha-Points in Preemptive Single Machine Scheduling
- Foto Afrati, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, and Maxim SviridenkoApproximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
- Rolf H. Möhring, Martin Skutella, and Frederik StorkForcing Relations for AND/OR Precedence Constraints
-
Scheduling unrelated machines by randomized rounding
- Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, and Yaoguang WangSingle Machine Scheduling with Release Dates
- Michel X. Goemans and Martin SkutellaCooperative facility location games
- Olaf Jahn, Rolf H. Möhring, and Andreas S. SchulzOptimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion