Greedy heuristics for the diameter-constrained minimum spanning tree problem
From MaRDI portal
Publication:844529
DOI10.1007/S10958-009-9611-ZzbMath1192.90183OpenAlexW2037725797WikidataQ58024601 ScholiaQ58024601MaRDI QIDQ844529
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
Related Items (2)
Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
Cites Work
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
- Multicommodity flow models for spanning trees with hop constraints
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- A New Class of Algorithms for Multipoint Network Optimization
- Random-tree Diameter and the Diameter-constrained MST
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- A textbook of graph theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Greedy heuristics for the diameter-constrained minimum spanning tree problem
