The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
type: Item
instance of: scholarly article
title: The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
zbMATH Open document ID: 1073.68061
DOI: 10.1016/S0166-218X(02)00420-1
author: Harold Connamacher
author: Andrzej Proskurowski
published in: Discrete Applied Mathematics
publication date: 2003-09-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1985921
MaRDI profile type: Publication
cites work: MAD trees and distance-hereditary graphs
cites work: Q4198056
cites work: Optimum Communication Spanning Trees
cites work: The complexity of the network design problem
cites work: Minimum eccentricity multicast trees
cites work: Multi-source spanning trees: Algorithms for minimizing source eccentricities.
cites work: Spanning Trees—Short or Small
cites work: Approximation algorithms for some optimum communication spanning tree problems
description: scientific article; zbMATH DE number 1985921