On the complexity of an optimal routing tree problem
type: Item
instance of: scholarly article
title: On the complexity of an optimal routing tree problem
zbMATH Open document ID: 0676.90091
DOI: 10.1007/BF02006188
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4108532
zbMATH Keywords: set packing
zbMATH Keywords: routing tree
zbMATH Keywords: decision tree
zbMATH Keywords: minimum cost
zbMATH Keywords: NP-complete
author: Du Ding-Zhu
author: Ker-I Ko
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf02006188
OpenAlex ID: W2016093718
Recommended article: Optimal Bounds for Matching Routing on Trees
Recommended article: Robust optimization for routing problems on trees
Recommended article: Routing on trees via matchings
Recommended article: Approximating capacitated tree-routings in networks
Recommended article: Approximating Capacitated Tree-Routings in Networks
Recommended article: Exact algorithms for minimum routing cost trees
Recommended article: Algorithmic Applications in Management
Recommended article: On the computational complexity of continuous routing
Recommended article: The complexity of rerouting shortest paths
Recommended article: The Complexity of Rerouting Shortest Paths
description: scientific article; zbMATH DE number 4108532