Approximating capacitated tree-routings in networks

DOI10.1007/S10878-009-9238-5zbMATH Open1213.90215OpenAlexW2007645296MaRDI QIDQ630195FDOQ630195

Authors Ehab Morsy, Hiroshi Nagamochi

Publication date 17 March 2011

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-009-9238-5

zbMATH Keywords

graph algorithmrouting problemstree cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Approximating Capacitated Tree-Routings in Networks
• Approximating the Generalized Capacitated Tree-Routing Problem
• On the approximation of the generalized capacitated tree-routing problem
• An improved approximation algorithm for capacitated multicast routings in networks
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem

Cites work

• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• 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
• Approximation algorithms for a capacitated network design problem
• Automata, Languages and Programming
• Balancing minimum spanning trees and shortest-path trees
• Computing and Combinatorics
• The Rectilinear Steiner Tree Problem is $NP$-Complete

Cited in

(15)

• scientific article; zbMATH DE number 1670539 (Why is no real title available?)
• On the approximation of the generalized capacitated tree-routing problem
• On the complexity of an optimal routing tree problem
• An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
• A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
• scientific article; zbMATH DE number 1979520 (Why is no real title available?)
• Capacitated Vehicle Routing on Trees
• Approximating Capacitated Tree-Routings in Networks
• Approximation to the Minimum Cost Edge Installation Problem
• An improved approximation algorithm for capacitated multicast routings in networks
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• Approximating the Generalized Capacitated Tree-Routing Problem
• Flow trees for vertex-capacitated networks
• A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
• Automata, Languages and Programming

This page was built for publication: Approximating capacitated tree-routings in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630195)