Finding bounded diameter minimum spanning tree in general graphs

DOI10.1016/J.COR.2022.105822OpenAlexW4224074580WikidataQ114193075 ScholiaQ114193075MaRDI QIDQ2147109FDOQ2147109

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

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

zbMATH Keywords

graph theoryminimum spanning treebounded diameter minimum spanning tree

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating the degree-bounded minimum diameter spanning tree problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)