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 di erent colors. We consider the problem of ÿnding 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. ?
In REF , the authors consider the problem of finding a spanning tree of minimum diameter with respect to the reload costs and they propose inapproximability results for graphs of maximum degree 5 and polynomial results for graphs of maximum degree 3.
Reload cost problems: minimum diameter spanning tree
Discret. Appl. Math.
Discret. Appl. Math.
Computer Science