scientific article; zbMATH DE number 91018

zbMATH Open0756.05061MaRDI QIDQ4017161FDOQ4017161

Authors: N. R. Achuthan, Louis Caccetta 

Publication date: 16 January 1993

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

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

zbMATH Keywords

treeoptimizationspanning treeslinear programmingdiameterbranch and bound method

Mathematics Subject Classification ID

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

Cited In (15)

• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• Degree-bounded minimum spanning trees
• Counting weighted spanning trees to solve constrained minimum spanning tree problems
• Minimum restricted diameter spanning trees.
• Minimum spanning trees in networks with varying edge weights
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mathematical programming models for some smallest-world problems
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
• Minimum diameter vertex-weighted Steiner tree
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Degree-bounded minimum spanning tree for unit disk graph
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm

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)