Optimizing node infiltrations in complex networks by a local search based heuristic

DOI10.1016/J.COR.2019.06.011MaRDI QIDQ2273672zbMATH OpenOpenAlexWikidataFDO

Authors Humberto M. Trujillo, M. Lozano

Publication date 25 September 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.06.011

zbMATH Keywords

betweenness centralitycombinatorial optimizationlocal searchmetaheuristicsnetwork interventions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improving the betweenness centrality of a node by adding links
• On the maximum betweenness improvement problem
• scientific article; zbMATH DE number 7075920
• Compressive sensing of high betweenness centrality nodes in networks
• scientific article; zbMATH DE number 6474901

Cites work

• A faster algorithm for betweenness centrality*
• A faster algorithm to update betweenness centrality after node alteration
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• A taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study
• A threshold of ln n for approximating set cover
• Compressive sensing of high betweenness centrality nodes in networks
• Detecting critical nodes in sparse graphs
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Emergence of Scaling in Random Networks
• Fast approximation of betweenness centrality through sampling
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 6917138 (Why is no real title available?)
• Identifying sets of key players in a social network
• Improving the betweenness centrality of a node by adding links
• Iterated greedy for the maximum diversity problem
• Methods for removing links in a network to minimize the spread of infections
• Multi-start methods for combinatorial optimization
• On the maximum betweenness improvement problem
• Optimal attack strategy of complex networks based on tabu search
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Optimizing network robustness by edge rewiring: a general framework
• Renormalization group analysis of the small-world network model
• The critical node detection problem in networks: a survey
• The design of approximation algorithms
• The parameterized complexity of centrality improvement in networks

Describes a project that uses

Uses Software

• SNAP
• igraph
• EdgeRewire
• NetworkX
• KONECT
• NetworKit

This page was built for publication: Optimizing node infiltrations in complex networks by a local search based heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273672)