The minimum centroid branch spanning tree problem

DOI10.1007/s40305-022-00419-3MaRDI QIDQ6566796

Cheng He, Hao Lin

Publication date: 3 July 2024

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

zbMATH Keywords

polynomial-time algorithmNP-hardnessspanning tree optimizationcentroid branch

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• Some properties of graph centroids
• Parameterized complexity of the spanning tree congestion problem
• Minimal congestion trees
• Tree spanners on chordal graphs: complexity and algorithms
• Spanning Trees with Many Leaves
• Tree Spanners
• Optimization of spanning tree stretch and congestion for graphs
• Combinatorial optimization. Theory and algorithms.

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