Intersection of Two Matroids: (Condensed) Border Graphs and Ranking

DOI10.1137/0402002zbMath0675.05018OpenAlexW2028883334MaRDI QIDQ3829563

Horst W. Hamacher, Paolo M. Camerini

Publication date: 1989

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0402002

zbMATH Keywords

algorithmsmatroidsmaximum weight intersection

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (10)

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ A note on \(K\) best network flows ⋮ A bound for the symmetric travelling salesman problem through matroid formulation ⋮ On generalized balanced optimization problems ⋮ Polymatroids: Construction and random algorithms ⋮ The image of weighted combinatorial problems ⋮ Random pseudo-polynomial algorithms for some combinatorial programming problems ⋮ Crashing a maximum-weight complementary basis ⋮ In memoriam Paolo M. Camerini ⋮ Two-best solutions under distance constraints: The model and exemplary results for matroids

This page was built for publication: Intersection of Two Matroids: (Condensed) Border Graphs and Ranking