Finding bounded diameter minimum spanning tree in general graphs

DOI10.1016/J.COR.2022.105822MaRDI QIDQ2147109zbMATH OpenOpenAlexWikidataFDO

Authors Michael Segal, Oren Tzfaty

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)

Recommendations

• scientific article; zbMATH DE number 731844
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 5730481 (Why is no real title available?)
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• scientific article; zbMATH DE number 1594512 (Why is no real title available?)
• Approximating the degree-bounded minimum diameter spanning tree problem
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• scientific article; zbMATH DE number 540118 (Why is no real title available?)
• Degree-bounded minimum spanning tree for unit disk graph

This page was built for publication: Finding bounded diameter minimum spanning tree in general graphs

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