Abstract
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs arise at the nodes of the graph and are depending on the colors of the pair of edges used by a walk through the node.In this paper we consider the problem of finding a spanning tree of minimum diameter with respect to the underlying reload costs. We present hardness results and 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.KeywordsTransportation problemsNetwork DesignDiameterSpanning TreeNode weighted graphs
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
