Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2011.01.010 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2011.01.010 / rank | |||
Normal rank |
Latest revision as of 16:56, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of an iterated local search algorithm for vertex cover in sparse random graphs |
scientific article |
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