Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,613,941 papers from all fields of science
Search
Sign In
Create Free Account
Matroid intersection
In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Broader (1)
Combinatorial optimization
Directed graph
Eugene Lawler
Graphic matroid
Hamiltonian path
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Reachability-based matroid-restricted packing of arborescences Csaba Király ? and Zoltán Szigeti ? ?
C. Király
2016
Corpus ID: 9943920
The fundamental result of Edmonds [5] started the area of packing arborescences and the great number of recent results shows…
Expand
2015
2015
Parallel algorithms for matroid intersection and matroid parity
Jinyu Huang
Discret. Math. Algorithms Appl.
2015
Corpus ID: 33366516
A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that…
Expand
2012
2012
Parallel Complexity for Matroid Intersection and Matroid Parity Problems
Jinyu Huang
Electron. Colloquium Comput. Complex.
2012
Corpus ID: 16396326
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid…
Expand
2012
2012
A Combinatoric Interpretation of Dual Variables for Weighted Matching Problems
H. Gabow
2012
Corpus ID: 16300052
We consider four weighted matching-type problems: the bipartite graph and general graph versions of matching and f -factors. The…
Expand
2011
2011
The bicriteria minimum spanning tree problem ∗
Yen Hung Chen
2011
Corpus ID: 13632713
Let G = (V,E) be an undirected graph with a weight function and a cost function on edges. The bicriteria minimum spanning tree…
Expand
2011
2011
5. Lecture Notes on Matroid Intersection
M. Goemans
2011
Corpus ID: 50054658
One nice feature about matroids is that a simple greedy algorithm allows to optimize over its independent sets or over its bases…
Expand
2010
2010
Query Lower Bounds for Matroid Intersection (Combinatorial Optimization and Discrete Algorithms)
Nicholas J. A. Harvey
2010
Corpus ID: 117884593
We consider the number of queries needed to solve the matroid intersection problem, a question raised by Welsh (1976). Given two…
Expand
2006
2006
Matroid Intersection and its application to a Multiple Depot, Multiple TSP
S. Rathinam
,
R. Sengupta
2006
Corpus ID: 56270891
This paper extends the Held-Karp's lower bound available for a single Travelling Salesman Problem to the following symmetric…
Expand
1984
1984
Data structures for on-line updating of matroid intersection solutions
G. Frederickson
,
M. Srinivas
Symposium on the Theory of Computing
1984
Corpus ID: 2487255
Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q…
Expand
1983
1983
On a "primal" matroid intersection algorithm
Orlin James B. .
,
J. VandeVate
1983
Corpus ID: 13305024
Given two matroids M1 = (S, 1 1 ) and M2 = (S, 12) and a weight function s on S, the weighted matroid intersection problem is to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE