The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm

DOI10.3969/J.ISSN.1672-8513.2012.04.016MaRDI QIDQ4926072zbMATH OpenFDO

Authors

Publication date 20 June 2013

Full work available at URL https://doi.org/10.3969/J.ISSN.1672-8513.2012.04.016

zbMATH Keywords

degree-constraineddiameter-constrainedheuristic algorithmminimum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
• Approximating the degree-bounded minimum diameter spanning tree problem
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• scientific article; zbMATH DE number 91018

Cited in

(17)

• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Algorithms for degree-constrained Euclidean Steiner minimal tree
• A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
• A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
• An algorithm for \(k^{\text{th}}\) minimum spanning tree
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• scientific article; zbMATH DE number 2155132 (Why is no real title available?)
• scientific article; zbMATH DE number 1910742 (Why is no real title available?)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• Greedy heuristics for the diameter-constrained minimum spanning tree problem

This page was built for publication: The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm

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