login

Matroids and the greedy algorithm

Mathematical ProgrammingPublished 1 December 1971
Jack Edmonds
Citations867
SJR quartileQ1
SJR score1.73
SNIP2.20

TL;DR

Linear-algebra rank is the solution to an especially tractable optimization problem which are linear programs relative to certain derived polyhedra.

Abstract

Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.

Keywords

Computer ScienceMathematics