A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0607039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053658161 / rank | |||
Normal rank | |||
Revision as of 02:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices |
scientific article |
Statements
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (English)
0 references
1986
0 references
Minimum Cost Maximal Covering Problem
0 references
Totally balanced matrices
0 references
tree network location
0 references
