Greedy heuristics for the diameter-constrained minimum spanning tree problem
type: Item
instance of: scholarly article
title: Greedy heuristics for the diameter-constrained minimum spanning tree problem
zbMATH Open document ID: 1192.90183
published in: Journal of Mathematical Sciences (New York)
publication date: 2010-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5660170
Wikidata QID: Q58024601
author: Cristina Requejo
author: Eulália Santos
MaRDI profile type: Publication
full work available at URL: s10958-009-9611-z
OpenAlex ID: W2037725797
cites work: Random-tree Diameter and the Diameter-constrained MST
cites work: Q4949873
cites work: Q4393323
cites work: Q4017161
cites work: Q4325280
cites work: A textbook of graph theory
cites work: Q2728889
cites work: Q4198056
cites work: Multicommodity flow models for spanning trees with hop constraints
cites work: Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
cites work: An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
cites work: A New Class of Algorithms for Multipoint Network Optimization
cites work: A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
DOI: 10.1007/S10958-009-9611-Z
Recommended article: Greedy heuristics for the bounded diameter minimum spanning tree problem
Recommended article: A hybrid heuristic for the diameter constrained minimum spanning tree problem
Recommended article: New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
Recommended article: Q5475932
Recommended article: Q4949834
Recommended article: Heuristic search for the generalized minimum spanning tree problem
Recommended article: Q4926072
description: scientific article; zbMATH DE number 5660170