Reload cost problems: Minimum diameter spanning tree

DOI10.1016/S0166-218X(00)00392-9zbMath1003.05061OpenAlexW2071771001MaRDI QIDQ5948962

Jan Steffan, Hans-Christoph Wirth

Publication date: 30 July 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00392-9

zbMATH Keywords

transportation problemsdiameterspanning treeoptimization problemexact algorithmedge-weighted graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Traffic problems in operations research (90B20)

Related Items (20)

On Minimum Reload Cost Cycle Cover ⋮ Reload cost trees and network design ⋮ Parameterized complexity of the MinCCA problem on graphs of bounded decomposability ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ Parameterized complexity of finding a spanning tree with minimum reload cost diameter ⋮ On the complexity of constructing minimum changeover cost arborescences ⋮ On minimum reload cost cycle cover ⋮ On minimum reload cost paths, tours, and flows ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ The Minimum Reload s-t Path/Trail/Walk Problems ⋮ The minimum reload \(s-t\) path, trail and walk problems ⋮ Constructing minimum changeover cost arborescenses in bounded treewidth graphs ⋮ The complexity of a minimum reload cost diameter problem ⋮ Minimum reload cost graph factors ⋮ Unnamed Item ⋮ On Solving the Quadratic Shortest Path Problem ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The complexity of designing a network with minimum diameter

This page was built for publication: Reload cost problems: Minimum diameter spanning tree