Matroid Intersection
From MaRDI portal
Publication:3205244
DOI10.1016/S0167-5060(08)70817-3zbMATH Open0416.05025OpenAlexW4234130962MaRDI QIDQ3205244FDOQ3205244
Authors: Jack Edmonds Edit this on Wikidata
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
Cited In (62)
- Matroid Intersection under Restricted Oracles
- Recognizing Even-Cycle and Even-Cut Matroids
- Independence-domination duality
- On minimum power connectivity problems
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Axioms for infinite matroids
- Crashing a maximum-weight complementary basis
- Brick decompositions and the matching rank of graphs
- 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
- A simple algorithm and min-max formula for the inverse arborescence problem
- Matroids and a forest cover problem
- The ellipsoid method and its consequences in combinatorial optimization
- 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
- Approximate tradeoffs on weighted labeled matroids
- The intersection of a matroid and a simplicial complex
- A weighted linear matroid parity algorithm
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- Linear matroid intersection is in quasi-NC
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Body-and-cad geometric constraint systems
- Finding feasible vectors of Edmonds-Giles polyhedra
- Independence systems with continuous cardinality of bases
- Generalized polymatroids and submodular flows
- Finding all common bases in two matroids
- Even factors, jump systems, and discrete convexity
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
- Theory of principal partitions revisited
- Discrete convex analysis
- A weighted independent even factor algorithm
- 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
- Matroid matching and some applications
- On stability of collaborative supplier selection
- Connected and alternating vectors: Polyhedra and algorithms
- Approximation algorithms for graph augmentation
- A unifying model for locally constrained spanning tree problems
- Poset matching---a distributive analog of independent matching
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- On some algorithmic investigations of star partitions of graphs
- Coloring by two-way independent sets
- Cutting planes in integer and mixed integer programming
- 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
- Title not available (Why is that?)
- Packing of arborescences with matroid constraints via matroid intersection
- Recent trends in combinatorial optimization
- 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)
