期刊
INFORMS JOURNAL ON COMPUTING
卷 31, 期 2, 页码 367-389出版社
INFORMS
DOI: 10.1287/ijoc.2018.0829
关键词
critical edge detection; network interdiction; closeness centrality; distance-based centrality; mixed integer programming
资金
- Defense Threat Reduction Agency [HDTRA1-14-1-0065]
- Air Force Office of Scientific Research [FA2386-12-1-3032]
- U.S. Air Force Research Laboratory (AFRL) Mathematical Modeling and Optimization Institute
- AFRL, Munitions Directorate (AFRL/RW) [FA8651-14-2-0002]
Closeness centrality is a class of distance-based measures in the network analysis literature to quantify reachability of a given vertex (or a group of vertices) by other network agents. In this paper, we consider a new class of critical edge detection problems, in which given a group of vertices that represent an important subset of network elements of interest (e.g., servers that provide an essential service to the network), the decision maker is interested in identifying a subset of critical edges whose removal maximally degrades the closeness centrality of those vertices. We develop a general optimization framework, in which the closeness centrality measure can be based on any nonincreasing function of distances between vertices, which, in turn, can be interpreted as communication efficiency between them. Our approach includes three well-known closeness centrality measures as special cases: harmonic centrality, decay centrality, and k step reach centrality. Furthermore, for quantifying the centrality of a group of vertices we consider three different approaches for measuring the reachability of the group from any vertex in the network: minimum distance to a vertex in the group, maximum distance to a vertex in the group, and the average centrality of vertices in the group. We study the theoretical computational complexity of the proposed models and describe the corresponding mixed integer programming formulations. For solving medium- and large-scale instances of the problem, we first develop an exact algorithm that exploits the fact that real-life networks often have rather small diameters. Then we propose two conceptually different heuristic algorithms. Finally, we conduct computational experiments with real-world and synthetic network instances under various settings, which reveal interesting insights and demonstrate the advantages and limitations of the proposed models and algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据