Valuated matroids: A new look at the greedy algorithm (Q913805): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Optimal assignments in an ordered set: An application of matroid theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Independence Functions / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0893-9659(90)90009-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094571546 / rank | |||
Normal rank |
Latest revision as of 10:31, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Valuated matroids: A new look at the greedy algorithm |
scientific article |
Statements
Valuated matroids: A new look at the greedy algorithm (English)
0 references
1990
0 references
greedy algorithm
0 references
weight functions
0 references
system of m-subsets
0 references