Increasing the weight of minimum spanning trees

Conference · Mon Dec 30 23:00:00 EST 1996

OSTI ID:416839

Frederickson, G N; Solis-Oba, R ^[1]

---

1. Purdue Univ., West Lafayette, IN (United States)

Given an undirected connected graph G and a cost function for increasing edge weights, the problem of determining the maximum increase in the weight of the minimum spanning trees of G subject to a budget constraint is investigated. Two versions of the problem are considered. In the first, each edge has a cost function that is linear in the weight increase. An algorithm is presented that solves this problem in strongly polynomial time. In the second version, the edge weights are fixed but an edge can be removed from G at a unit cost. This version is shown to be NP-hard. An {Omega}(1/ log k)-approximation algorithm is presented for it, where k is the number of edges to be removed.

• OSTI ID: 416839
• Report Number(s): CONF-960121--; CNN: Grant CCR-9322501
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
DIAGRAMS
NETWORK ANALYSIS
POLYNOMIALS