Hybrid constructive heuristics for the critical node problem
Hybrid constructive heuristics for the critical node problem
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
We consider the
Critical Node Problem
: given an undirected graph and an integer number
K
, at most
K
nodes have to be deleted from the graph in order to minimize a connectivity measure in the residual graph. We combine the basic steps used in common greedy algorithms with some flavour of local search, in order to obtain simple h...
Alternative Titles
Full title
Hybrid constructive heuristics for the critical node problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_01307739v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_01307739v1
Other Identifiers
ISSN
0254-5330
E-ISSN
1572-9338
DOI
10.1007/s10479-016-2110-y
