Improved Bounds for Matroid Partition and Intersection Algorithms
From MaRDI portal
Publication:3756518
DOI10.1137/0215066zbMath0619.68040OpenAlexW2020927880MaRDI QIDQ3756518
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215066
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (28)
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils ⋮ Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints ⋮ Evolutionary algorithms and matroid optimization problems ⋮ Tree automata and pigeonhole classes of matroids. I ⋮ An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm ⋮ The popular matching and condensation problems under matroid constraints ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ A bound for the symmetric travelling salesman problem through matroid formulation ⋮ Linking rigid bodies symmetrically ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ A generalized-polymatroid approach to disjoint common independent sets in two matroids ⋮ Clustered planarity testing revisited ⋮ A deterministic parallel reduction from weighted matroid intersection search to decision ⋮ Matroid Intersection under Restricted Oracles ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ A logarithmic approximation for polymatroid congestion games ⋮ Branch decomposition heuristics for linear matroids ⋮ On matching cover of graphs ⋮ On a weighted linear matroid intersection algorithm by deg-det computation ⋮ Approximating clique-width and branch-width ⋮ A flow model based on polylinking system ⋮ Extension of the normal tree method ⋮ A detachment algorithm for inferring a graph from path frequency ⋮ Envy-free matchings with one-sided preferences and matroid constraints ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ Finding all common bases in two matroids ⋮ Algorithms for the minimum weight of linear codes
This page was built for publication: Improved Bounds for Matroid Partition and Intersection Algorithms
