Matroid Intersection
From MaRDI portal
Cited in
(71)- Independence-domination duality
- On minimum power connectivity problems
- Axioms for infinite matroids
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Crashing a maximum-weight complementary basis
- Brick decompositions and the matching rank of graphs
- Finding spanning trees with perfect matchings
- Weighted linear matroid parity
- Improved approximation algorithms for maximum lifetime problems in wireless networks
- An application of submodular flows
- A generalization of antiwebs to independence systems and their canonical facets
- Matroids and a forest cover problem
- The ellipsoid method and its consequences in combinatorial optimization
- A simple algorithm and min-max formula for the inverse arborescence problem
- Bracing cubic grids - a necessary condition
- The generalized dependency constrained spanning tree problem
- The \(b\)-branching problem in digraphs
- Approximations for the disjoint paths problem in high-diameter planar networks
- Matroid Intersection under Restricted Oracles
- Hitting sets for orbits of circuit classes and polynomial families
- Approximate tradeoffs on weighted labeled matroids
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- The intersection of a matroid and a simplicial complex
- A weighted linear matroid parity algorithm
- Approximation algorithms for the airport and railway problem
- Linear matroid intersection is in quasi-NC
- Body-and-cad geometric constraint systems
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Online combinatorial assignment in independence systems
- Finding feasible vectors of Edmonds-Giles polyhedra
- Independence systems with continuous cardinality of bases
- Online combinatorial assignment in independence systems
- Generalized polymatroids and submodular flows
- Finding all common bases in two matroids
- Breaking O(nr) for matroid intersection
- Discrete convex analysis
- Even factors, jump systems, and discrete convexity
- Theory of principal partitions revisited
- A weighted independent even factor algorithm
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
- Alternating signed bipartite graphs and difference-1 colourings
- On a weighted linear matroid intersection algorithm by deg-det computation
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Rooted \(k\)-connections in digraphs
- Reachability in arborescence packings
- Quantum and classical query complexities for determining connectedness of matroids
- Matroid matching and some applications
- On stability of collaborative supplier selection
- Recognizing Even-Cycle and Even-Cut Matroids
- Connected and alternating vectors: Polyhedra and algorithms
- Poset matching---a distributive analog of independent matching
- A unifying model for locally constrained spanning tree problems
- Approximation algorithms for graph augmentation
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Coloring by two-way independent sets
- On some algorithmic investigations of star partitions of graphs
- Cutting planes in integer and mixed integer programming
- Approximation algorithms for the airport and railway problem
- The minimum spanning tree problem with conflict constraints and its variations
- Applications of combinatorics to statics --- a second survey
- On finding optimal polytrees
- An unbounded matroid intersection polyhedron
- Paths, trees and matchings under disjunctive constraints
- Recent trends in combinatorial optimization
- Packing of arborescences with matroid constraints via matroid intersection
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Faster matroid partition algorithms
- Exact and approximation algorithms for weighted matroid intersection
- Two algorithms for weighted matroid intersection
- Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: Matroid Intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3205244)
