A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2019.03.004 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128232644 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2019.03.004 / rank | |||
Normal rank | |||
Latest revision as of 20:46, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem |
scientific article |
Statements
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (English)
0 references
27 December 2019
0 references
partial cover
0 references
multi-cover
0 references
submodular cover
0 references
bicriteria algorithm
0 references
0 references
0 references
0 references
