Improving spanning trees by upgrading nodes

Citations of this article
Mendeley users who have this article in their library.


We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V,E) where node υ ∈ V can be upgraded at a cost of c(υ). This upgrade reduces the delay of each link emanating from υ. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has good performance. The performance is measured by the bottleneck weight of a minimum spanning tree. We give a polynomial time approximation algorithm with logarithmic performance guarantee, which is tight within a small constant factor as shown by our hardness results. © 1999 Published by Elsevier Science B.V. All rights reserved.




Krumke, S. O., Noltemeier, H., Wirth, H. C., Marathe, M. V., Ravi, R., Ravi, S. S., & Sundaram, R. (1999). Improving spanning trees by upgrading nodes. Theoretical Computer Science, 221(1–2), 139–155.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free