Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A linear programming approach to increasing the weight of all minimum spanning trees

Abstract : Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. We formulate this as a combinatorial linear program and give an algorithm.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00242975
Contributor : Department of Economics <>
Submitted on : Wednesday, February 6, 2008 - 3:42:59 PM
Last modification on : Thursday, March 5, 2020 - 6:21:18 PM
Long-term archiving on: : Saturday, May 8, 2010 - 2:06:32 AM

File

2005-05-24-889.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00242975, version 1

Collections

Citation

Mourad Baïou, Fancisco Barahona. A linear programming approach to increasing the weight of all minimum spanning trees. 2005. ⟨hal-00242975⟩

Share

Metrics

Record views

183

Files downloads

568