On the approximation of the generalized capacitated tree-routing problem
From MaRDI portal
Recommendations
- Approximating the Generalized Capacitated Tree-Routing Problem
- Approximating Capacitated Tree-Routings in Networks
- Approximating capacitated tree-routings in networks
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- An improved approximation algorithm for capacitated multicast routings in networks
Cites work
- Algorithm Theory - SWAT 2004
- An improved approximation algorithm for capacitated multicast routings in networks
- An improved approximation algorithm for multicast \(k\)-tree routing
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Approximating Capacitated Tree-Routings in Networks
- Approximating the Generalized Capacitated Tree-Routing Problem
- 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
- Capacitated Vehicle Routing on Trees
- Computing and Combinatorics
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- Improved Approximation for Single-Sink Buy-at-Bulk
Cited in
(7)- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Approximating the Generalized Capacitated Tree-Routing Problem
- scientific article; zbMATH DE number 1303035 (Why is no real title available?)
- scientific article; zbMATH DE number 2108935 (Why is no real title available?)
- Approximating Capacitated Tree-Routings in Networks
- Approximating capacitated tree-routings in networks
This page was built for publication: On the approximation of the generalized capacitated tree-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988692)
