Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035)
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 6034872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of an iterated local search algorithm for vertex cover in sparse random graphs |
scientific article; zbMATH DE number 6034872 |
Statements
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (English)
0 references
14 May 2012
0 references
randomized search heuristics
0 references
iterated local search
0 references
vertex cover
0 references
random graphs
0 references
Karp-Sipser algorithm
0 references
e-phenonemon
0 references
0 references
0 references
0 references
0.93696266412735
0 references
0.7676528692245483
0 references
0.7586056590080261
0 references
0.7472285032272339
0 references
