Minimum restricted diameter spanning trees.
type: Item
instance of: scholarly article
title: Minimum restricted diameter spanning trees.
zbMATH Open document ID: 1095.90094
DOI: 10.1016/S0166-218X(03)00360-3
author: Refael Hassin
author: Asaf Levin
published in: Discrete Applied Mathematics
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2056038
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Minimum diameter spanning trees
MaRDI profile type: Publication
cites work: A Graph-Theoretic Game and Its Application to the k-Server Problem
cites work: Q4542533
cites work: Q4542528
cites work: Q4198056
cites work: Steiner points in tree metrics don't (really) help
cites work: Parallel concepts in graph theory
cites work: On the minimum diameter spanning tree problem
cites work: Designing multi-commodity flow trees
cites work: Call routing and the ratcatcher
Recommended article: Q4411286
Recommended article: Minimum spanning tree with hop restrictions
Recommended article: Q4017161
Recommended article: Minimum Diameter Spanning Trees and Related Problems
Recommended article: Minimum spanning trees
Recommended article: Minimum spanning trees with sums of ratios.
Recommended article: Minimal spanning trees
Recommended article: Degree-bounded minimum spanning trees
Recommended article: Minimum spanning hypertrees
description: scientific article; zbMATH DE number 2056038