Multiple Hotlink Assignment (2002)
Sven Fuhrmann, Sven Oliver Krumke, Hans-christoph Wirth
The input for the hotlink assignment problem consists of a node weighted directed acyclic graph with a designated root node r. The goal is to minimize the weighted shortest path length rooted at r by...
Multicriteria approximation of network design and network upgrade problems / (2001)
Würzburg, University, Diss., 2001.
On The Minimum Label Spanning Tree Problem (2000)
Sven O. Krumke, Hans-christoph Wirth
. We study the Minimum Label Spanning Tree Problem. In this problem, we are given an undirected graph whose edges are labeled with colors. The goal is to nd a spanning tree which uses as least...
Euler is Standing in Line - Dial-a-Ride Problems with FIFO-Precedence-Constraints (1970)
Dietrich Hauptmeier, Krumke Rambau, Hans-christoph Wirth, D. Hauptmeier, S. O. Krumke, J. Rambau
. In this paper we study algorithms for "Dial-a-Ride" transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to...