论文信息 - A dual approximation approach to weighted matroid intersection

A dual approximation approach to weighted matroid intersection

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.

Satoru Iwata | Maiko Shigeno | S. Iwata | M. Shigeno | Maiko Shigeno

[1] Ulrich Faigle. Combinatorial Geometries: Matroids in Combinatorial Optimization , 1987 .

[2] K. Murota. Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability , 1987 .

[3] Ravindra K. Ahuja,et al. New scaling algorithms for the assignment and minimum mean cycle problems , 1992, Math. Program..

[4] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.

[5] Fred W. Glover,et al. Two algorithms for weighted matroid intersection , 1986, Math. Program..

[6] Martin Grötschel,et al. Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[7] A. Recski. Matroid theory and its applications in electric network theory and in statics , 1989 .

[8] S. Fujishige,et al. AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM , 1995 .

[9] James G. Oxley,et al. Matroid theory , 1992 .

[10] M. Iri,et al. Applications of Matroid Theory , 1982, ISMP.