Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Reload cost problems: Minimum diameter spanning tree

: Wirth, H.-C.; Steffan, J.


Discrete applied mathematics 113 (2001), Nr.1, S.73-85
ISSN: 0166-218X
Fraunhofer SIT ()

We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of different colors. We consider the problem of finding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On the other hand we provide an exact algorithm for graphs of maximum degree 3.