Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7091686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximation algorithms for maximum coverage with group budget constraints |
scientific article; zbMATH DE number 7091686 |
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
0.9490331411361694
0 references
0.8849261403083801
0 references
0.8666278123855591
0 references
0.8597103953361511
0 references
0.8099120259284973
0 references
