Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

NETWORKS

2008

2008

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. Frederickson and Solis-Oba gave an algorithm for the case when the costs are linear, we give a different derivation of their algorithm and we slightly extend it to deal with convex piecewise linear costs. For that we formulate the problem as a combinatorial linear program and show how to produce primal and dual solutions.

Related Content

Added |
14 Dec 2010 |

Updated |
14 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
NETWORKS |

Authors |
Mourad Baïou, Francisco Barahona |

Comments (0)