Greedy approximations for minimum submodular cover with submodular cost (Q2379694): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algorithms - ESA 2003 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228484 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4943600 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank | |||
Normal rank | |||
Latest revision as of 15:17, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy approximations for minimum submodular cover with submodular cost |
scientific article |
Statements
Greedy approximations for minimum submodular cover with submodular cost (English)
0 references
19 March 2010
0 references
greedy approximations
0 references
minimum submodular cover
0 references
