arrow
返回

Minimum edge blocker dominating set problem

delete2015-11-01
delete21
delete
OA
AI
F
Foad Mahdavi Pajouh
J
Jose L. Walteros
V
Vladimir Boginski *
E
Eduardo Pasiliao
DOI:10.1016/j.ejor.2015.05.037delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper introduces and studies the minimum edge blocker dominating set problem (EBDP), which is formulated as follows. Given a vertex-weighted undirected graph and r> 0, remove a minimum number of edges so that the weight of any dominating set in the remaining graph is at least r. Dominating sets are used in a wide variety of graph-based applications such as the analysis of wireless and social networks. We show that the decision version of EBDP is NP-hard for any fixed r> 0. We present an analytical lower bound for the value of an optimal solution to EBDP and formulate this problem as a linear 0-1 program with a large number of constraints. We also study the convex hull of feasible solutions to EBDP and identify facet-inducing inequalities for this polytope. Furthermore, we develop the first exact algorithm for solving EBDP, which solves the proposed formulation by a branch-and-cut approach where nontrivial constraints are applied in a lazy fashion. Finally, we also provide the computational results obtained by using our approach on a test-bed of randomly generated instances and real-life power-law graphs. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keyword:
Network interdiction
Minimum weighted dominating set
NP-hardness
Branch-and-cut algorithm
Critical elements detection
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
University of Massachusetts Boston
学者数:
2.4K
论文数: 1.9K
被引数: 4.2K
U
university of massachusetts system
学者数:
3.9W
论文数: 3.6W
被引数: 42
S
state university of new york (suny) system
学者数:
6.5W
论文数: 5.8W
被引数: 65
U
university at buffalo, suny
学者数:
1.2W
论文数: 9.5K
被引数: 9
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Cryptosporidium sp. in cultivated oysters and the natural oyster stock of the state of Maranhão, Brazil
err2023-01-01
err0
errOAAI
errCamila Moraes Silva; Anna Letícia Pinto Silva; Karinne Francisca Cardoso Watanabe; Raimunda Deusilene Barreira Porto; Danilo Cutrim Bezerra; Larissa Sarmento dos Santos Ribeiro; Viviane Correa Silva Coimbra; Hamilton Pereira Santos; Nancyleni Pinto Chaves Bezerra
err分享
err收藏
Detecting critical nodes in sparse graphs
err2009-07-01
err292
PREAI
errArulselvan, Ashwin; Commander, Clayton W.; Elefteriadou, Lily; Pardalos, Panos M.
err分享
err收藏
First Report of Zoonotic Genotype of Giardia duodenalis in Mussels (Mytilus edulis) from Patagonia Argentina来自阿根廷巴塔哥尼亚的贻贝 (Mytilus edulis) 中 十二指肠贾第鞭毛虫 的人畜共患病基因型的第一份报告
err2021-02-01
err0
errOAAI
errClaudia Torrecillas; María Angélica Fajardo; María Alejandra Córdoba; Marco Sánchez; Ivana Mellado; Betiana Garrido; Isabel Aleixandre-Górriz; Paula Sánchez-Thevenet; David Carmena
err分享
err收藏
Complexity of the critical node problem over trees
err2011-12-01
err64
errOAAI
errDi Summa, Marco; Grosso, Andrea; Locatelli, Marco
err分享
err收藏
err分享
err收藏
Interactions of mechanotransduction pathways
err2003-01-01
err0
PREAI
errVénus Labrador; Kuang‐Den Chen; Yi‐Shuan Li; Sylvaine Muller; Jean‐François Stoltz; Shu Chien
err分享
err收藏
学者 查看更多内容