Elsevier

Discrete Applied Mathematics

Volume 113, Issue 1, 30 September 2001, Pages 73-85
Discrete Applied Mathematics

Reload cost problems: minimum diameter spanning tree

https://doi.org/10.1016/S0166-218X(00)00392-9Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Transportation problems
Network design
Diameter
Spanning tree
Node weighted graphs

Cited by (0)

Supported by Deutsche Forschungsgemeinschaft (DFG), Grant NO 88/15-3.