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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

We consider the number of queries needed to solve the matroid intersection problem, a question raised by Welsh (1976). Given two…

2008

We propose an algorithm for Rado’s min-max formula, which, by a polynomial reduction, also implies a polynomial time algorithm…

2006

This paper extends the Held-Karp's lower bound available for a single Travelling Salesman Problem to the following symmetric…

1997

LetM1 andM2 be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc…

1995

We present algorithms for thek-Matroid Intersection Problem and for the Matroidk-Parity Problem when the matroids are represented…

1994

Algorithms for the maximum weight transversal matroid intersection problems are presented. Efficient implementations are given…

1989

The matroid matching problem (also known as matroid parity problem) has been intensively studied by several authors. Starting…

1985

The problems of finding a maximal cardinality or a maximal weight matroid intersection problem are well solved. We introduce…

1983

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…

1979

Given a matroid, where each element has a realvalued cost and is colored red or green; we seek a minimum cost base with exactly q…