Approximating capacitated tree-routings in networks
type: Item
instance of: scholarly article
title: Approximating capacitated tree-routings in networks
zbMATH Open document ID: 1213.90215
author: Ehab Morsy
author: Hiroshi Nagamochi
published in: Journal of Combinatorial Optimization
publication date: 2011-03-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5866924
zbMATH Keywords: graph algorithm
zbMATH Keywords: routing problems
zbMATH Keywords: tree cover
MaRDI profile type: Publication
full work available at URL: s10878-009-9238-5
OpenAlex ID: W2007645296
cites work: Computing and Combinatorics
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Approximation algorithms for a capacitated network design problem
cites work: Automata, Languages and Programming
cites work: Balancing minimum spanning trees and shortest-path trees
cites work: An improved approximation algorithm for multicast \(k\)-tree routing
cites work: An improved approximation algorithm for capacitated multicast routings in networks
cites work: Q4952699
cites work: Approximating the single-sink link-installation problem in network design
DOI: 10.1007/S10878-009-9238-5
description: scientific article; zbMATH DE number 5866924