2026-07-25T03:00:24Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12252 2024-03-06T10:49:27Z ddc:004 open_access

Vertex Downgrading to Minimize Connectivity Aissi, Hassene Chen, Da Qi Ravi, R. Vertex Interdiction Vertex Downgrading Network Interdiction Approximation Algorithm We consider the problem of interdicting a directed graph by deleting nodes with the goal of minimizing the local edge connectivity of the remaining graph from a given source to a sink. We introduce and study a general downgrading variant of the interdiction problem where the capacity of an arc is a function of the subset of its endpoints that are downgraded, and the goal is to minimize the downgraded capacity of a minimum source-sink cut subject to a node downgrading budget. This models the case when both ends of an arc must be downgraded to remove it, for example. For this generalization, we provide a bicriteria (4,4)-approximation that downgrades nodes with total weight at most 4 times the budget and provides a solution where the downgraded connectivity from the source to the sink is at most 4 times that in an optimal solution. We accomplish this with an LP relaxation and rounding using a ball-growing algorithm based on the LP values. We further generalize the downgrading problem to one where each vertex can be downgraded to one of k levels, and the arc capacities are functions of the pairs of levels to which its ends are downgraded. We generalize our LP rounding to get a (4k,4k)-approximation for this case. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hassene Aissi and Da Qi Chen and R. Ravi 2020 Is Part Of LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SWAT.2020.5 urn:nbn:de:0030-drops-122527 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.5 eng https://creativecommons.org/licenses/by/3.0/legalcode