In combinatorics, a branch of mathematics, a matroid /ˈmeɪtrɔɪd/ is a structure that captures and generalizes the notion of linear independence in… (More)

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

Highly Cited

2013

Highly Cited

2013

- Itzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis
- IEEE Transactions on Information Theory
- 2013

Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
- SIAM J. Comput.
- 2011

Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Salim Y. El Rouayheb, Alexander Sprintson, Costas N. Georghiades
- IEEE Transactions on Information Theory
- 2010

The <i>index coding</i> problem has recently attracted a significant attention from the research community due to its theoretical… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
- IPCO
- 2007

Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Randall Dougherty, Christopher F. Freiling, Kenneth Zeger
- IEEE Transactions on Information Theory
- 2007

We define a class of networks, called matroidal networks, which includes as special cases all scalar-linearly solvable networks… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Jack Edmonds
- Combinatorial Optimization
- 2001

I The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- James G. Oxley
- 1992

The comments below apply to all printings of the book dated 2005 or earlier. The table following contains more than just a list… (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Harold N. Gabow
- STOC
- 1991

We present an algorithm that finds the edge connect ivity A of a directed graph in time O(Arn log (n2/rn)) and is slightly faster… (More)

Is this relevant?