A dual approximation approach to weighted matroid intersection

DOI10.1016/0167-6377(95)00047-XzbMath0855.90110WikidataQ126536206 ScholiaQ126536206MaRDI QIDQ1919181

Satoru Iwata, Maiko Shigeno

Publication date: 1 August 1996

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

scaling algorithmminimum weight common basepair of matroids

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Robustness of minimum cost arborescences ⋮ Exact and approximation algorithms for weighted matroid intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems analysis by graphs and matroids. Structural solvability and controllability
• New scaling algorithms for the assignment and minimum mean cycle problems
• Matroid theory and its applications in electric network theory and in statics
• Two algorithms for weighted matroid intersection
• A weighted matroid intersection algorithm
• AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM

This page was built for publication: A dual approximation approach to weighted matroid intersection