A dual approximation approach to weighted matroid intersection

Authors:
Maiko Shigeno;Satoru Iwata
Affiliations:
Department of Information Sciences, Tokyo Institute of Technology, Tokyo 152, Japan;Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606, Japan
Venue:
Operations Research Letters
Year:
1995

Citing 2
Cited 1

Two algorithms for weighted matroid intersection

Mathematical Programming: Series A and B
New scaling algorithms for the assignment and minimum mean cycle problems

Mathematical Programming: Series A and B

An algorithmic framework for wireless information flow

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a simple algorithm for finding a minimum weight common base of a pair of matroids. The algorithm approximately splits the weight and maintains two optimal bases with respect to the split weights. The algorithm consists of only local operations and is fairly easy to implement.