Woeginger Gerhard

Gerhard Woeginger

Information about the author Gerhard Woeginger will soon be added to the site.
Found 7 papers in total
Between a rock and a hard place: the two‐to‐one assignment problem
Between a rock and a hard place: the two‐to‐one assignment problem
2012
We describe the two‐to‐one assignment problem, a problem in between the...
Scheduling of pipelined operator graphs
Scheduling of pipelined operator graphs
2012
We investigate a class of scheduling problems that arise in the optimization of SQL...
Caching Is Hard–Even in the Fault Model
Caching Is Hard–Even in the Fault Model
2012
We prove strong ℕℙ ‐completeness for the four variants of caching...
Open-shop scheduling with release dates to minimize maximum lateness
Open-shop scheduling with release dates to minimize maximum lateness
1995
The authors present the first polynomial-time algorithm for an open-shop problem with...
On the Euclidean two paths problem
On the Euclidean two paths problem
1993
Given a set of polygonal obstacles in the Euclidean plane with a total number of n...
The exact LPT-bound for maximizing the minimum completion time
The exact LPT-bound for maximizing the minimum completion time
1992
The authors consider the problem of assigning a set of jobs to a system of m identical...
Polynomial graph-colorings
Polynomial graph-colorings
1992
For directed graphs G and H , the authors say that G is H -colorable, if there is a...
Papers per page: