Finding bounded diameter minimum spanning tree in general graphs

DOI10.1016/j.cor.2022.105822OpenAlexW4224074580WikidataQ114193075 ScholiaQ114193075MaRDI QIDQ2147109

Oren Tzfaty, Michael Segal

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105822

zbMATH Keywords

graph theoryminimum spanning treebounded diameter minimum spanning tree

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• Approximating the weight of shallow Steiner trees
• Generalized submodular cover problems and applications
• Asymptotics for Euclidean functionals with power-weighted edges
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Approximating \(k\)-hop minimum-spanning trees
• Boundary domination and the distribution of the largest nearest-neighbor link in higher dimensions
• Bicriteria Network Design Problems
• Minimum spanning tree with hop restrictions
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• Greedy heuristics for the bounded diameter minimum spanning tree problem