direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 1999

1996


1998

Preprint 595-1998
Rolf H. Möhring and Andreas S. Schulz and Marc Uetz.
Approximation in stochastic scheduling: The power of LP-based priority policies.


Preprint 611-1998
Rolf H. Möhring and Markus W. Schäffter.
Scheduling Series-Parallel Orders Subject to 0/1-Communication Delays.


Preprint 591-1998
Müller-Hannemann, Matthias and Schwartz, Alexander.
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.


1999

Preprint -1999
Afrati, Foto and Bampis, Evripidis and Chekuri, Chandra and Karger, David and Kenyon, Claire and Khanna, Sanjeev and Milis, Ioannis and Queyranne, Maurice and Skutella, Martin and Stein, Cliff and Sviridenko, Maxim.
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.


Preprint 654-1999
Goemans, Michel X. and Queyranne, Maurice and Schulz, Andreas S. and Skutella, Martin and Wang, Yaoguang.
Single Machine Scheduling with Release Dates.


Preprint 655-1999
Goemans, Michel X. and Skutella, Martin.
Cooperative facility location games.


Preprint 658-1999
Olaf Jahn and Rolf H. Möhring and Andreas S. Schulz.
Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion.



Preprint 646-1999
Rolf H. Möhring and Martin Skutella and Frederik Stork.
Forcing Relations for AND/OR Precedence Constraints.


Preprint 632-1999
Müller-Hannemann, Matthias.
Shelling Hexahedral Complexes for Mesh Generation.


Preprint 631-1999
Müller-Hannemann, Matthias and Schwartz, Alexander.
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.


Preprint 633-1999
Müller-Hannemann, Matthias and Weihe, Karsten.
On the Discrete Core of Quadrilateral Mesh Refinement.


Preprint 639-1999
Schulz, Andreas S. and Skutella, Martin.
The Power of α–Points in Preemptive Single Machine Scheduling.


Preprint 653-1999
Schulz, Andreas S. and Skutella, Martin.
Scheduling unrelated machines by randomized rounding.