On minimum diameter spanning trees under reload costs

DOI10.1007/3-540-46784-X_9MaRDI QIDQ4944969zbMATH OpenFDO

Authors Jan Steffan, H.-C. Wirth

Publication date 27 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46784-X_9

zbMATH Keywords

minimum diameternetwork designnode weighted graphsspanning treetransportation problems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• The complexity of a minimum reload cost diameter problem
• Reload cost problems: Minimum diameter spanning tree
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter
• Reload cost trees and network design

Cited in

(8)

• The complexity of a minimum reload cost diameter problem
• The non-approximability of bicriteria network design problems
• The symmetric quadratic traveling salesman problem
• Reload cost trees and network design
• Minimizing diameters of dynamic trees
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter
• Reload cost problems: Minimum diameter spanning tree
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter

This page was built for publication: On minimum diameter spanning trees under reload costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944969)