Kontrolle Projektbereich Diskrete, Diskrete Optimierung, Hans Kellerer, Hans Kellerer, Thomas Tautenhahn, Thomas Tautenhahn, ...
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total flow time. This problem is well-known to be NPcomplete, and the best...
Kontrolle Projektbereich Diskrete, Diskrete Optimierung, Gunter Rote, Triangulations Intersect Nicely, Oswin Aichholzer, Oswin Aichholzer, ...
We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identical edge in the other...
Kontrolle Projektbereich Diskrete, Diskrete Optimierung, Volker Kaibel, Gunter Rote, Bericht Nr, Endgultige Fassung Janner
We prove two new upper bounds on the number of facets that a d-dimensional 0/1-polytope can have. The first one is 2(d \Gamma 1)! + 2(d \Gamma 1) (which is the best one currently known for small...
Kontrolle Projektbereich Diskrete, Spezialforschungsbereich F, Bericht Nr, Helmut Alt, Helmut Alt, ...
This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex #gure over another, minimizing the area of their symmetric...