scientific article; zbMATH DE number 1420900

zbMATH Open0938.90071MaRDI QIDQ4944969FDOQ4944969

Authors: Jan Steffan, H.-C. Wirth 

Publication date: 27 June 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

network designspanning treeminimum diametertransportation problemsnode weighted graphs

Mathematics Subject Classification ID

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

Cited In (8)

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

This page was built for publication:

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