The minimum centroid branch spanning tree problem

DOI10.1007/S40305-022-00419-3MaRDI QIDQ6566796zbMATH OpenFDO

Authors Hao Lin, Cheng He

Publication date 3 July 2024

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40305-022-00419-3

zbMATH Keywords

centroid branchNP-hardnesspolynomial-time algorithmspanning tree optimization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• On central spanning trees of a graph
• The minimum stretch spanning tree problem for typical graphs
• scientific article; zbMATH DE number 2086635
• Bounded-degree spanning tree problems: models and new algorithms
• Centering a spanning tree of a biconnected graph

Cites work

• Combinatorial optimization. Theory and algorithms.
• Graph theory
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Minimal congestion trees
• On the minimum diameter spanning tree problem
• Optimization of spanning tree stretch and congestion for graphs
• Parameterized complexity of the spanning tree congestion problem
• Some properties of graph centroids
• Spanning Trees with Many Leaves
• Tree Spanners
• Tree spanners on chordal graphs: complexity and algorithms

Cited in

(1)

• On central spanning trees of a graph

This page was built for publication: The minimum centroid branch spanning tree problem

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