On the approximation of the generalized capacitated tree-routing problem
type: Item
instance of: scholarly article
title: On the approximation of the generalized capacitated tree-routing problem
zbMATH Open document ID: 1203.90171
author: Ehab Morsy
author: Hiroshi Nagamochi
published in: Journal of Discrete Algorithms
publication date: 2010-08-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5772513
zbMATH Keywords: approximation algorithm
zbMATH Keywords: graph algorithm
zbMATH Keywords: routing problems
zbMATH Keywords: network optimization
zbMATH Keywords: tree cover
MaRDI profile type: Publication
full work available at URL: j.jda.2009.08.002
OpenAlex ID: W2019630562
cites work: Computing and Combinatorics
cites work: An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
cites work: Improved Approximation for Single-Sink Buy-at-Bulk
cites work: Approximation algorithms for a capacitated network design problem
cites work: Automata, Languages and Programming
cites work: Algorithm Theory - SWAT 2004
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: Approximating Capacitated Tree-Routings in Networks
cites work: Approximating the Generalized Capacitated Tree-Routing Problem
cites work: Capacitated Vehicle Routing on Trees
cites work: Q4952699
cites work: Approximating the single-sink link-installation problem in network design
DOI: 10.1016/J.JDA.2009.08.002
description: scientific article; zbMATH DE number 5772513