Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient approximation algorithms for maximum coverage with group budget constraints |
scientific article |
Statements
Efficient approximation algorithms for maximum coverage with group budget constraints (English)
0 references
9 August 2019
0 references
maximum coverage problem with group budget constraints
0 references
approximation algorithm
0 references
auxiliary graph
0 references
network flow
0 references
randomized linear programming rounding
0 references
0 references
