Matroid intersection algorithms
From MaRDI portal
Publication:4077061
DOI10.1007/BF01681329zbMath0315.90039OpenAlexW2054232722WikidataQ56851487 ScholiaQ56851487MaRDI QIDQ4077061
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01681329
Numerical mathematical programming methods (65K05) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Unnamed Item, The popular matching and condensation problems under matroid constraints, Generalized polymatroids and submodular flows, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Shortest bibranchings and valuated matroid intersection, Packing of arborescences with matroid constraints via matroid intersection, Analyzing Residual Random Greedy for monotone submodular maximization, Clustered planarity testing revisited, The \(b\)-branching problem in digraphs, A deterministic parallel reduction from weighted matroid intersection search to decision, Alternating signed bipartite graphs and difference-1 colourings, Matroid Intersection under Restricted Oracles, Independence systems with continuous cardinality of bases, A weighted independent even factor algorithm, Unnamed Item, Discrete extremal problems, Colorful linear programming, Nash equilibrium, and pivots, Input matrix construction and approximation using a graphic approach, On a base exchange game on bispanning graphs, On a weighted linear matroid intersection algorithm by deg-det computation, A Weighted Linear Matroid Parity Algorithm, On the cardinality constrained matroid polytope, Crashing a maximum-weight complementary basis, Paroids: A canonical format for combinatorial optimization, Persistency in combinatorial optimization problems on matroids, Edge-disjoint spanning trees and depth-first search, The Held—Karp algorithm and degree-constrained minimum 1-trees, Even factors, jump systems, and discrete convexity, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, A detachment algorithm for inferring a graph from path frequency, Fractional matroid matchings, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Heuristically guided algorithm for k-parity matroid problems, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Exact and approximation algorithms for weighted matroid intersection, Unnamed Item, Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings, Boolean sublattices connected with minimization problems on matroids, The ellipsoid method and its implications, Finding all common bases in two matroids, Recent trends in combinatorial optimization, Minimum cost source location problem with vertex-connectivity requirements in digraphs, Approximation by lexicographically maximal solutions in matching and matroid intersection problems
Cites Work
