Matroid Intersection
From MaRDI portal
Publication:3205244
DOI10.1016/S0167-5060(08)70817-3zbMath0416.05025OpenAlexW4234130962MaRDI QIDQ3205244
Publication date: 1979
Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70817-3
Related Items
Recognizing Even-Cycle and Even-Cut Matroids, Matroids and a forest cover problem, The generalized dependency constrained spanning tree problem, On some algorithmic investigations of star partitions of graphs, Reachability in arborescence packings, Generalized polymatroids and submodular flows, A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, An application of submodular flows, Ejection chains, reference structures and alternating path methods for traveling salesman problems, A simple algorithm and min-max formula for the inverse arborescence problem, A generalization of antiwebs to independence systems and their canonical facets, Bracing cubic grids - a necessary condition, Axioms for infinite matroids, Packing of arborescences with matroid constraints via matroid intersection, The \(b\)-branching problem in digraphs, Two algorithms for weighted matroid intersection, Matroid matching and some applications, 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, The minimum spanning tree problem with conflict constraints and its variations, Theory of Principal Partitions Revisited, Paths, trees and matchings under disjunctive constraints, Body-and-cad geometric constraint systems, The ellipsoid method and its consequences in combinatorial optimization, On a weighted linear matroid intersection algorithm by deg-det computation, A Weighted Linear Matroid Parity Algorithm, On finding optimal polytrees, Crashing a maximum-weight complementary basis, Poset matching---a distributive analog of independent matching, Independence-domination duality, Applications of combinatorics to statics --- a second survey, Cutting planes in integer and mixed integer programming, On minimum power connectivity problems, Approximating minimum power covers of intersecting families and directed edge-connectivity problems, Improved approximation algorithms for maximum lifetime problems in wireless networks, Linear matroid intersection is in quasi-NC, An unbounded matroid intersection polyhedron, Approximation algorithms for graph augmentation, Semi-streaming algorithms for submodular matroid intersection, Even factors, jump systems, and discrete convexity, On stability of collaborative supplier selection, A unifying model for locally constrained spanning tree problems, Semi-streaming algorithms for submodular matroid intersection, Packing of mixed hyperarborescences with flexible roots via matroid intersection, Connected and alternating vectors: Polyhedra and algorithms, Approximations for the disjoint paths problem in high-diameter planar networks, Rooted \(k\)-connections in digraphs, Exact and approximation algorithms for weighted matroid intersection, Solving combinatorial problems with combined min-max-min-sum objective and applications, Unnamed Item, Discrete convex analysis, Coloring by two-way independent sets, The intersection of a matroid and a simplicial complex, Finding all common bases in two matroids, Recent trends in combinatorial optimization, Decreasing minimization on M-convex sets: algorithms and applications, Brick decompositions and the matching rank of graphs, Finding feasible vectors of Edmonds-Giles polyhedra, Approximate tradeoffs on weighted labeled matroids
