K-greedy algorithms for independence systems (Q4173194): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Lower bounds on the worst-case complexity of some oracle algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank | |||
Normal rank | |||
Revision as of 23:40, 12 June 2024
scientific article; zbMATH DE number 3607811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | K-greedy algorithms for independence systems |
scientific article; zbMATH DE number 3607811 |
Statements
K-greedy algorithms for independence systems (English)
0 references
1978
0 references
Independence Systems
0 references
Greedy Algorithm
0 references
Combinatorial Optimization
0 references
Enumeration
0 references
Computational Efficiency
0 references
