返回
Hybrid constructive heuristics for the critical node problem
DOI:10.1007/s10479-016-2110-y.png)
摘要
En 中文
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 hybrid heuristic algorithms. The obtained algorithms are shown to be effective, delivering improved performances (solution quality and speed) with respect to known greedy algorithms and other more sophisticated state of the art methods.
Keyword:
Critical node problem
Graph fragmentation
Hybrid heuristics
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
First Report of Zoonotic Genotype of Giardia duodenalis in Mussels (Mytilus edulis) from Patagonia Argentina来自阿根廷巴塔哥尼亚的贻贝 (Mytilus edulis) 中 十二指肠贾第鞭毛虫 的人畜共患病基因型的第一份报告

