Reformulations and complexity of the clique interdiction problem by graph mapping

被引:1
|
作者
Mattia, Sara [1 ]
机构
[1] CNR, Ist Anal Sistemi & Informat, Rome, Italy
关键词
Maximum clique; Bilevel programming; Edge clique interdiction; Node clique interdiction; Complexity; Single level reformulation; Facets; MAXIMUM CLIQUE; BOUND ALGORITHM; SET;
D O I
10.1016/j.dam.2021.06.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show how to solve a maximum clique problem on a given graph by an equivalent problem on an auxiliary graph. The transformation has interesting consequences in the bilevel setting. In fact, it allows to map a clique interdiction problem with edge interdiction into a clique interdiction problem with node interdiction. As a byproduct of the mapping, we can generalize to the edge interdiction problem complexity and algorithmic results that hold for the node interdiction problem. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:48 / 57
页数:10
相关论文
共 50 条