Efficient Algorithms for Robustness in Matroid Optimization (1996)
| Venue: | PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (NEW |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Frederickson96efficientalgorithms,
author = {Greg N. Frederickson and Roberto Solis-Oba},
title = {Efficient Algorithms for Robustness in Matroid Optimization},
booktitle = {PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (NEW},
year = {1996},
pages = {659--668},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The robustness function of a matroid measures the maximum increase in the weight of its minimum weight bases that can be produced by increases of a given total cost on the weights of its elements. We present an algorithm for computing this function, that runs in strongly polynomial time for matroids in which independence can be tested in strongly polynomial time. We identify key properties of transversal, scheduling and partition matroids, and exploit them to design robustness algorithms that are more efficient than our general algorithm.
