A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189)
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: A constructive proof of swap local search worst-case instances for the maximum coverage problem |
scientific article; zbMATH DE number 6946088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constructive proof of swap local search worst-case instances for the maximum coverage problem |
scientific article; zbMATH DE number 6946088 |
Statements
A constructive proof of swap local search worst-case instances for the maximum coverage problem (English)
0 references
2 October 2018
0 references
maximum weighted coverage problem
0 references
swap local search
0 references
worst-case performance
0 references
symmetry
0 references
locality gap
0 references
0.8697992
0 references
0.8497913
0 references
0.84942144
0 references
0.8473323
0 references
0 references
0.84354234
0 references
0.84271204
0 references
0.8392898
0 references
0.83595705
0 references
