Efficient algorithms for a family of matroid intersection problems
From MaRDI portal
Publication:3335803
DOI10.1016/0196-6774(84)90042-7zbMath0545.05029MaRDI QIDQ3335803
Harold N. Gabow, Robert Endre Tarjan
Publication date: 1984
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(84)90042-7
68Q25: Analysis of algorithms and problem complexity
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Small degree out‐branchings, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Color constrained combinatorial optimization problems, Steiner trees with \(n\) terminals among \(n+1\) nodes, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, The vertex degrees of minimum spanning trees, Matroid optimization with generalized constraints, An exact algorithm for the capacitated shortest spanning arborescence