Improving minimum cost spanning trees by upgrading nodes

PDF Version Also Available for Download.

Description

The authors study budget constrained network upgrading problems. The authors are given an undirected edge weighted graph (G = V, E) where node v {element_of} V can be upgraded at a cost of c(v). This upgrade reduces the weight of each edge incident on v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a minimum spanning tree of weight no more than a given budget D. The results obtained in the paper include the following: (1) on the positive side, they provide a polynomial time approximation algorithm for ... continued below

Physical Description

16 p.

Creation Information

Krumke, S.O.; Noltemeier, H.; Wirth, H.C.; Marathe, M.V.; Ravi, R.; Ravi, S.S. et al. November 1, 1998.

Context

This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Authors

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Description

The authors study budget constrained network upgrading problems. The authors are given an undirected edge weighted graph (G = V, E) where node v {element_of} V can be upgraded at a cost of c(v). This upgrade reduces the weight of each edge incident on v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a minimum spanning tree of weight no more than a given budget D. The results obtained in the paper include the following: (1) on the positive side, they provide a polynomial time approximation algorithm for the above upgrading problem when the difference between the maximum and minimum edge weights is bounded by a polynomial in n, the number of nodes in the graph, the solution produced by the algorithm satisfies the budget constrain, and the cost of the upgrading set produced by the algorithm is O (log n) times the minimum upgrading cost needed to obtain a spanning tree of weight at most D; (2) in contrast , they show that, unless NP {improper_subset} DTIME (n{sup O(log log n)}), there can be no polynomial time approximation algorithm for the problem that produces a solution with upgrading cost at most {alpha} < ln n times the optimal upgrading cost even if the budget can be violated by a factor f(n), for any polynomial time computable function f(n), this result continues to hold, with f(n) = n{sup k} being any polynomial, even when the difference between the maximum and minimum edge weights is bounded by a polynomial in n; and (3) finally, they show that using a simple binary search over the set of admissible values, the dual problem can be solved with an appropriate performance guarantee.

Physical Description

16 p.

Notes

OSTI as DE99000846

Source

  • Other Information: PBD: [1998]

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • Other: DE99000846
  • Report No.: LA-UR--98-1496
  • Grant Number: W-7405-ENG-36
  • DOI: 10.2172/677151 | External Link
  • Office of Scientific & Technical Information Report Number: 677151
  • Archival Resource Key: ark:/67531/metadc706888

Collections

This report is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this report?

When

Dates and time periods associated with this report.

Creation Date

  • November 1, 1998

Added to The UNT Digital Library

  • Sept. 12, 2015, 6:31 a.m.

Description Last Updated

  • Feb. 29, 2016, 9:25 p.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 3

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Krumke, S.O.; Noltemeier, H.; Wirth, H.C.; Marathe, M.V.; Ravi, R.; Ravi, S.S. et al. Improving minimum cost spanning trees by upgrading nodes, report, November 1, 1998; New Mexico. (digital.library.unt.edu/ark:/67531/metadc706888/: accessed August 14, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.