Approximating capacitated tree-routings in networks
From MaRDI portal
Publication:630195
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
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
- Computing and Combinatorics
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Title not available (Why is that?)
- An improved approximation algorithm for capacitated multicast routings in networks
- An improved approximation algorithm for multicast \(k\)-tree routing
- Automata, Languages and Programming
- Approximation algorithms for a capacitated network design problem
- Balancing minimum spanning trees and shortest-path trees
- Approximating the single-sink link-installation problem in network design
Cited In (15)
- A $1.6$ Approximation Algorithm for Routing Multiterminal Nets
- Automata, Languages and Programming
- Title not available (Why is that?)
- Flow trees for vertex-capacitated networks
- Approximation to the Minimum Cost Edge Installation Problem
- On the approximation of the generalized capacitated tree-routing problem
- On the complexity of an optimal routing tree problem
- Capacitated Vehicle Routing on Trees
- Approximating Capacitated Tree-Routings in Networks
- Title not available (Why is that?)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Approximating the Traffic Grooming Problem in Tree and Star Networks
- Approximating the Generalized Capacitated Tree-Routing Problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- An improved approximation algorithm for capacitated multicast routings in networks
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)
