Approximation algorithms for maximum coverage with group budget constraints (Q1708624)
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: Approximation algorithms for maximum coverage with group budget constraints |
scientific article; zbMATH DE number 6852656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for maximum coverage with group budget constraints |
scientific article; zbMATH DE number 6852656 |
Statements
Approximation algorithms for maximum coverage with group budget constraints (English)
0 references
26 March 2018
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
partition
0 references
0.9490331411361694
0 references
0.920594036579132
0 references
0.9031351208686828
0 references
0.8849714994430542
0 references
0.8327683806419373
0 references
