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

DOI10.1137/0402002MaRDI QIDQ3829563zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(11)

• 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
• Two-best solutions under distance constraints: The model and exemplary results for matroids
• A bound for the symmetric travelling salesman problem through matroid formulation
• In memoriam Paolo M. Camerini
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• A note on \(K\) best network flows
• scientific article; zbMATH DE number 5888307 (Why is no real title available?)
• On generalized balanced optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829563)