A constrained independent set problem for matroids

Tamás Fleiner, András Frank, Satoru Iwata

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)23-26
Number of pages4
JournalOperations Research Letters
Volume32
Issue number1
DOIs
Publication statusPublished - Jan 1 2004

Keywords

  • MS matchings
  • Matroid intersection
  • Matroid parity

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A constrained independent set problem for matroids'. Together they form a unique fingerprint.

  • Cite this