On the approximation of the generalized capacitated tree-routing problem

DOI10.1016/j.jda.2009.08.002zbMath1203.90171OpenAlexW2019630562MaRDI QIDQ988692

Hiroshi Nagamochi, Ehab Morsy

Publication date: 18 August 2010

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.08.002

zbMATH Keywords

graph algorithmapproximation algorithmnetwork optimizationrouting problemstree cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Approximation algorithms for a capacitated network design problem
• Balancing minimum spanning trees and shortest-path trees
• An improved approximation algorithm for capacitated multicast routings in networks
• An improved approximation algorithm for multicast \(k\)-tree routing
• Approximating the Single-Sink Link-Installation Problem in Network Design
• Approximating the Generalized Capacitated Tree-Routing Problem
• Capacitated Vehicle Routing on Trees
• Algorithm Theory - SWAT 2004
• Approximating Capacitated Tree-Routings in Networks
• Improved Approximation for Single-Sink Buy-at-Bulk
• Automata, Languages and Programming
• An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
• Computing and Combinatorics