A constrained independent set problem for matroids

A constrained independent set problem for matroids

0.00 Avg rating0 Votes
Article ID: iaor20043382
Country: Netherlands
Volume: 32
Issue: 1
Start Page Number: 23
End Page Number: 26
Publication Date: Jan 2004
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: mathematical
Abstract:

In this note, we study a constrained independent set problem for matroids. The problem can be regarded as an ordered version of the matroid parity problem. By a reduction of this problem to matroid intersection, we prove a min–max formula. We show how earlier results of Hefner and Kleinschmidt on the so-called MS-matchings fit in our framework.

Reviews

Required fields are marked *. Your email address will not be published.