Algorithmic characterization of bipartite b-matching and matroid intersection

Authors:
Robert T. Firla;Bianca Spille;Robert Weismantel
Affiliations:
Institute for Mathematical Optimization, University of Magdeburg, Universitätsplatz 2, D-39106 Magdeburg, Germany;EPFL-DMA, CH-1015 Lausanne, Switzerland;Institute for Mathematical Optimization, University of Magdeburg, Universitätsplatz 2, D-39106 Magdeburg, Germany
Venue:
Combinatorial optimization - Eureka, you shrink!
Year:
2003

Citing 5
Cited 0

Two algorithms for weighted matroid intersection

Mathematical Programming: Series A and B
Intersection of two matroids: (condensed) border graphs and ranking

SIAM Journal on Discrete Mathematics
Combinatorial optimization

Handbook of combinatorics (vol. 2)
Combinatorial optimization

Combinatorial optimization
0/1-Integer Programming: Optimization and Augmentation are Equivalent

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithmic characterization of a particular combinatorial optimization problem means that there is an algorithm that works exact if and only if applied to the combinatorial optimization problem under investigation. According to Jack Edmonds, the Greedy algorithm leads to an algorithmic characterization of matroids. We deal here with the algorithmic characterization of the intersection of two matroids. To this end we introduce two different augmentation digraphs for the intersection of any two independence systems. Paths and cycles in these digraphs correspond to candidates for improving feasible solutions. The first digraph gives rise to an algorithmic characterization of bipartite b-matching. The second digraph leads to a polynomial-time augmentation algorithm for the (weighted) matroid intersection problem and to a conjecture about an algorithmic characterization of matroid intersection.