𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time

✍ Scribed by Czumaj, Artur; Sohler, Christian

Book ID
118180783
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
266 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear programming approach to increas
A linear programming approach to increasing the weight of all minimum spanning trees
✍ Mourad BaΓ―ou; Francisco Barahona πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## 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. Frederickson and Solis‐Oba gave an