Approximation algorithms
Reload cost problems: minimum diameter spanning tree
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reload cost trees and network design
Networks
The Minimum Reload s-t Path/Trail/Walk Problems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
The minimum reload s-t path, trail and walk problems
Discrete Applied Mathematics
On minimum changeover cost arborescences
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Reload cost trees and network design
Networks
On Minimum Reload Cost Cycle Cover
Discrete Applied Mathematics
| Hi-index | 0.04 |
We consider the minimum diameter spanning tree problem under the reload cost model which has been introduced by Wirth and Steffan [H.-C. Wirth, J. Steffan, Reload cost problems: Minimum diameter spanning tree, Discrete Appl. Math. 113 (2001) 73-85]. In this model an undirected edge-coloured graph G is given, together with a nonnegative symmetrical integer matrix R specifying the costs of changing from a colour to another one. The reload cost of a path in G arises at its internal nodes, when passing from the colour of one incident edge to the colour of the other. We prove that, unless P=NP, the problem of finding a spanning tree of G having a minimum diameter with respect to reload costs, when restricted to graphs with maximum degree 4, cannot be approximated within any constant @a