Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Improved approximation algorithms for the capacitated multicast routing problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Approximating the Generalized Capacitated Tree-Routing Problem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On the approximation of the generalized capacitated tree-routing problem
Journal of Discrete Algorithms
| Hi-index | 0.00 |
The capacitated tree-routing problem (CTR) in a graph G = (V,E) consists of an edge weight function w : E → R+, a sink s ∈ V, a terminal set M ⊆ V with a demand function q : M → R+, a routing capacity κ 0, and an integer edge capacity λ ≥ 1. The CTR asks to find a partition M = {Z1, Z2,..., Zl} of M and a set T = {T1, T2,..., Tl} of trees of G such that each Ti spans Zi ∪ {s} and satisfies Σv∈Ziq(v) ≤ κ. A subset of trees in T can pass through a single copy of an edge e ∈ E as long as the number of these trees does not exceed the edge capacity λ; any integer number of copies of e are allowed to be installed, where the cost of installing a copy of e is w(e). The objective is to find a solution (M, T) that minimizes the installing cost Σe∈E⌈|{T ∈ T | T contains e}|/λw(e). In this paper, we propose a (2+ρST)-approximation algorithm to the CTR, where ρST is any approximation ratio achievable for the Steiner tree problem.