New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
type: Item
instance of: scholarly article
title: New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
zbMATH Open document ID: 1327.90354
author: Wolfgang Steitz
published in: INFORMS Journal on Computing
publication date: 2015-09-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6480975
zbMATH Keywords: backbone
zbMATH Keywords: bounded-diameter minimum spanning tree problem
zbMATH Keywords: construction heuristics
zbMATH Keywords: diameter
zbMATH Keywords: optimization
zbMATH Keywords: spanning trees
MaRDI profile type: Publication
full work available at URL: ijoc.2014.0617
OpenAlex ID: W2026551358
DOI: 10.1287/IJOC.2014.0617
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: Greedy heuristics for the diameter-constrained minimum spanning tree problem
Recommended article: Approximating the degree-bounded minimum diameter spanning tree problem
Recommended article: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Recommended article: Q5475932
description: scientific article