Optimality characterization of the minimum stretch spanning tree problem for interval graphs

DOI10.15960/J.CNKI.ISSN.1007-6093.2020.04.014MaRDI QIDQ4986072zbMATH OpenFDO

Authors Hao Lin, Lan Lin

Publication date 26 April 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2020.04.014

zbMATH Keywords

spanning treeinterval graphtree-stretch

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)

Recommendations

• The minimum stretch spanning tree problem for typical graphs
• Optimality computation of the minimum stretch spanning tree problem
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
• Optimization of spanning tree stretch and congestion for graphs
• Hardness and efficiency on minimizing maximum distances in spanning trees

Cited in

(4)

• The minimum stretch spanning tree problem for typical graphs
• Optimality computation of the minimum stretch spanning tree problem
• Optimization of spanning tree stretch and congestion for graphs
• On minimum average stretch spanning trees in grid graphs

This page was built for publication: Optimality characterization of the minimum stretch spanning tree problem for interval graphs

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