An efficient local search framework for the minimum weighted vertex cover problem (Q2282264)
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 7148286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient local search framework for the minimum weighted vertex cover problem |
scientific article; zbMATH DE number 7148286 |
Statements
An efficient local search framework for the minimum weighted vertex cover problem (English)
0 references
7 January 2020
0 references
minimum weighted vertex cover
0 references
weighted configuration checking
0 references
scoring strategy
0 references
local search
0 references
massive graph instances
0 references
0 references
0 references
0 references
0.8749890923500061
0 references
0.8723657131195068
0 references
0.8624415993690491
0 references
0.8533967137336731
0 references
0.8400749564170837
0 references
