scientific article; zbMATH DE number 91018

MaRDI QIDQ4017161zbMATH OpenFDO

Authors N. R. Achuthan, Louis Caccetta

Publication date 16 January 1993

zbMATH Keywords

branch and bound methoddiameterlinear programmingoptimizationspanning treestree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 731844
• Minimum Diameter Spanning Trees and Related Problems
• Finding bounded diameter minimum spanning tree in general graphs
• scientific article; zbMATH DE number 1947056
• scientific article; zbMATH DE number 540118

Cited in

(16)

• Degree-bounded minimum spanning trees
• Minimum restricted diameter spanning trees.
• Counting weighted spanning trees to solve constrained minimum spanning tree problems
• Minimum diameter vertex-weighted Steiner tree
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Mathematical programming models for some smallest-world problems
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 540118 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
• Degree-bounded minimum spanning tree for unit disk graph
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Minimum spanning trees in networks with varying edge weights
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

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 Q4017161)