Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation schemes for capacitated geometric network design
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
We consider the minimum cost edge installation problem (MCEI) in a graph G = (V,E) with edge weight w(e) ≥ 0, e ∈ E. We are given a vertex s ∈ V designated as a sink, an edge capacity λ 0, and a source set S ⊆ V with demand q(v) ∈ [0, λ], v ∈ S. For any edge e ∈ E, we are allowed to install an integer number h(e) of copies of e. The MCEI asks to send demand q(v) from each source v ∈ S along a single path Pv to the sink s. A set of such paths can pass through a single copy of an edge in G as long as the total demand along the paths does not exceed the edge capacity λ. The objective is to find a set P = {Pv | v ∈ S} of paths of G that minimizes the installing cost Σe∈E h(e)w(e). In this paper, we propose a (15/8+ρST)-approximation algorithm to the MCEI, where ρST is any approximation ratio achievable for the Steiner tree problem.