Greedy heuristics for the diameter-constrained minimum spanning tree problem
From MaRDI portal
Publication:844529
DOI10.1007/S10958-009-9611-ZzbMATH Open1192.90183OpenAlexW2037725797WikidataQ58024601 ScholiaQ58024601MaRDI QIDQ844529FDOQ844529
Cristina Requejo, Eulália Santos
Publication date: 19 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9611-z
Recommendations
- Greedy heuristics for the bounded diameter minimum spanning tree problem
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
- scientific article; zbMATH DE number 5036665
- scientific article; zbMATH DE number 1439455
- Heuristic search for the generalized minimum spanning tree problem
- The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
Cites Work
- Title not available (Why is that?)
- A textbook of graph theory
- Title not available (Why is that?)
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
- Multicommodity flow models for spanning trees with hop constraints
- Title not available (Why is that?)
- Random-tree Diameter and the Diameter-constrained MST
- Title not available (Why is that?)
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Title not available (Why is that?)
- A New Class of Algorithms for Multipoint Network Optimization
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
- A greedy heuristic for a minimum-weight forest problem
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
This page was built for publication: Greedy heuristics for the diameter-constrained minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844529)
