# Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

```@inproceedings{Jothi2005ApproximationAF,
title={Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design},
author={R. Mary Jeya Jothi and Balaji Raghavachari},
booktitle={TALG},
year={2005}
}```
• Published in TALG 12 July 2004
• Computer Science
Given an undirected graph <i>G</i> = (<i>V,E</i>) withnonnegative costs on its edges, a root node <i>r</i> <i>V</i>, aset of demands <i>D</i> <i>V</i> with demand <i>v</i> <i>D</i>wishing to route <i>w(v)</i> units of flow (weight) to <i>r</i>,and a positive number <i>k</i>, the <i>Capacitated Minimum SteinerTree</i> (CMStT) problem asks for a minimum Steiner tree, rooted at<i>r</i>, spanning the vertices in <i>D</i> *&lcub;<i>r</i>&rcub;, in which the sum of the vertexweights in every subtree…

## Figures and Tables from this paper

### Approximating the Generalized Capacitated Tree-Routing Problem

• Computer Science
COCOON
• 2008
In this paper, we introduce the generalized capacitated tree-routing problem(GCTR), which is described as follows. Given a connected graph G= (V,E) with a sink si¾? Vand a set Mi¾? Vi¾? {s} of

### Approximation algorithms for single-sink edge installation problems and other graph problems

• Computer Science, Mathematics
• 2004
Many network design problems require designing networks that obey certain constraints. Minimum spanning tree, Steiner tree, vehicle routing, and facility location problems are examples. The goal is

### Approximation Algorithms for Multicast Routings in a Network with Multi-Sources

• Mathematics
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
• 2007
A (2ρUFL + ρST)-approximation algorithm to the CMMTR is proposed, where ρUFL and ρ ST are any approximation ratios achievable for the uncapacitated facility location and the Steiner tree problems, respectively.

### Approximating capacitated tree-routings in networks

• Computer Science
J. Comb. Optim.
• 2007
A (2+ρST)-approximation algorithm to CTR is proposed, where ρST is any approximation ratio achievable for the Steiner tree problem.

### Formulations for designing robust networks

• Mathematics, Computer Science
• 2017
This work searches for a minimum cost subset E′ ⊂ E, covering T and r, such that the network induced by E′ is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T .

## References

SHOWING 1-10 OF 49 REFERENCES

### A general approximation technique for constrained forest problems

• Computer Science
SODA '92
• 1992
The first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems are derived.

### A branch and bound algorithm for the capacitated minimum spanning tree problem

• Computer Science
Networks
• 1993
This paper presents a new formulation and a full optimization algorithm by branch and bound to find a minimum spanning tree for graph G such that the sum of demands on each branch stem from the center does not exceed a given capacity.

### Approximation Algorithms for a Capacitated Network Design Problem

• Computer Science
Algorithmica
• 2003
An approximation algorithm with performance ratio (ρST + 2) where ρST is the performance ratio of any approximation algorithm for the minimum Steiner tree problem and improves to 2 when all nodes in the graph are sources.

### Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem

• L. Hall
• Computer Science
INFORMS J. Comput.
• 1996
This paper focuses on the unit-demand case, known as the capacitated spanning tree problem, for which it presents computational experience on a range of instances with up to 200 nodes, and considers the general- demand case, based on a cutting plane algorithm.

### Heuristics with Constant Error Guarantees for the Design of Tree Networks

• Computer Science
• 1988
An efficient heuristic algorithm based on partitioning of a traveling salesman tour that finds a solution whose cost is at most 3-2/K times the minimum; in the general case the error bound is 4.

### Dynamic programming based heuristics for the topological design of local access networks

Ann. Oper. Res.
• 1991
A class of heuristics that combine dynamic programming with clustering and decomposition techniques in order to obtain smaller size problems that can be handled by a dynamic programming approach are presented.