scientific article; zbMATH DE number 540118

MaRDI QIDQ4286079zbMATH OpenFDO

Authors N. R. Achuthan, Louis Caccetta

Publication date 28 April 1994

zbMATH Keywords

diametermixed integer linear programmingoptimal treeminimum weight spanning tree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 91018
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 1534497
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• Finding bounded diameter minimum spanning tree in general graphs
• Additivity in minimum cost spanning tree problems
• Lower and upper bounds for the spanning tree with minimum branch vertices
• Approximating minimum bounded degree spanning trees to within one of optimal
• On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter

Cited in

(3)

• Additivity in minimum cost spanning tree problems
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

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