A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices |
scientific article; zbMATH DE number 3956815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices |
scientific article; zbMATH DE number 3956815 |
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
0.8171423077583313
0 references
0.7662093639373779
0 references
