Algorithms for measuring perturbality in matroid optimization (Q1297736)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for measuring perturbality in matroid optimization |
scientific article; zbMATH DE number 1336283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for measuring perturbality in matroid optimization |
scientific article; zbMATH DE number 1336283 |
Statements
Algorithms for measuring perturbality in matroid optimization (English)
0 references
14 September 1999
0 references
A matroid \((E,\mathcal I)\) and two nonnegative functions \(w\) and \(c\) on \(E\) are given. \(w(e)\) is the weight of an element \(e\in E\) and \(c(e)\) measures the cost of increasing \(w(e)\) by one unit. \(F(b)\) is the maximum increase of the weight of a minimum weight base while the weights are increased by a total cost of at most \(b\). The authors present a polynomial algorithm for computing \(F(b)\).
0 references
matroid optimization
0 references
0.8786491
0 references
0.8786491
0 references
0.8754984
0 references
0.87299794
0 references
0.86941695
0 references
0 references