An experimental comparison of three heuristics for the WVCP (Q1328615)
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 611345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An experimental comparison of three heuristics for the WVCP |
scientific article; zbMATH DE number 611345 |
Statements
An experimental comparison of three heuristics for the WVCP (English)
0 references
17 October 1994
0 references
heuristic methods
0 references
graph algorithms
0 references
simulated annealing
0 references
greedy algorithm
0 references
weighted vertex cover problem
0 references
0.7970925569534302
0 references
0.7789453268051147
0 references
0.770432710647583
0 references
