Improving spanning trees by upgrading nodes
- Univ. of Wuerzburg (Germany). Dept. of Computer Science; and others
We study budget constrained optimal network upgrading problems. Such problems aim at finding optimal strategies for improving a network under some cost measure subject to certain budget constraints. A general problem in this setting is the following. We are given an edge weighted graph G = (V, E) where nodes represent processors and edges represent bidirectional communication links. The processor at a node v {element_of} V can be upgraded at a cost of c(v). Such an upgrade reduces the delay of each link emanating from v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has the best performance with respect to some measure. We consider the problem under two measures, namely, the weight of a minimum spanning tree and the bottleneck weight of a minimum bottleneck spanning tree. We present approximation and hardness results for the problem. Our results are tight to within constant factors. We also show that these approximation algorithms can be used to construct good approximation algorithms for the dual versions of the problems where there is a budget constraint on the upgrading cost and the objectives are minimum weight spanning tree and minimum bottleneck weight spanning tree respectively.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 484581
- Report Number(s):
- LA-UR-97-476; CONF-970746-1; ON: DE97004796; TRN: 97:003832
- Resource Relation:
- Conference: International colloquium on automata, language and programming, Bologna (Italy), Jul 1997; Other Information: PBD: 16 Jan 1997
- Country of Publication:
- United States
- Language:
- English
Similar Records
On optimal strategies for upgrading networks
Node weighted network upgrade problems