Efficient algorithms for robustness in matroid optimization
Conference
·
OSTI ID:471723
- Purdue Univ., West Layfayette, IN (United States)
The robustness function of a matroid measures the maximum increase in the weight of its minimum weight bases that can be obtained 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.
- OSTI ID:
- 471723
- Report Number(s):
- CONF-970142--; CNN: Grant CCR-9322501
- Country of Publication:
- United States
- Language:
- English
Similar Records
New algorithms for linear k-matroid intersection and matroid k-parity problems
When is a 0-1 knapsack a matroid?
Post matching - a distributive analog of independent matching
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35811
When is a 0-1 knapsack a matroid?
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35806
Post matching - a distributive analog of independent matching
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36379