Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time (Q4596723)
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: Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time |
scientific article; zbMATH DE number 6816657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time |
scientific article; zbMATH DE number 6816657 |
Statements
Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time (English)
0 references
8 December 2017
0 references
0.7608942985534668
0 references
0.7583950161933899
0 references
0.7553725242614746
0 references
0.7534819841384888
0 references
0.7510376572608948
0 references
