The network inhibition problem
From MaRDI portal
Publication:5248549
DOI10.1145/167088.167286zbMath1310.90018OpenAlexW1986538507MaRDI QIDQ5248549
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167286
Related Items (53)
Efficient algorithms for robustness in resource allocation and scheduling problems ⋮ Interdicting facilities in tree networks ⋮ Approximating the Restricted 1-Center in Graphs ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Matching interdiction ⋮ Optimizing cost flows by edge cost and capacity upgrade ⋮ Unnamed Item ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Vertex downgrading to minimize connectivity ⋮ Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Upgrading \(p\)-median problem on a path ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ Robust flows with adaptive mitigation ⋮ Interdiction problems on planar graphs ⋮ Approximating the restricted 1-center in graphs ⋮ Approximation algorithms for \(k\)-hurdle problems ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ The subdivision-constrained routing requests problem ⋮ Models and methods for solving the problem of network vulnerability ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Scalable attack on graph data by injecting vicious nodes ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Protection of flows under targeted attacks ⋮ Maximum probability shortest path problem ⋮ Bilevel model for adaptive network flow problem ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Upgrading bottleneck constrained forests ⋮ Bottleneck Capacity Expansion Problems with General Budget Constraints ⋮ Heuristics for multi-stage interdiction of stochastic networks ⋮ Bounded-hops power assignment in ad hoc wireless networks ⋮ A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric ⋮ A simple efficient approximation scheme for the restricted shortest path problem ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ A decomposition algorithm applied to planning the interdiction of stochastic networks ⋮ Network flow interdiction on planar graphs ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Connectivity interdiction ⋮ On the power of randomization in network interdiction ⋮ Approximation Algorithms for k-Hurdle Problems ⋮ A survey of network interdiction models and algorithms ⋮ Theoretical and computational advances for network diversion ⋮ An approximation algorithm for network flow interdiction with unit costs and two capacities ⋮ Up- and downgrading the 1-center in a network ⋮ A linear time algorithm for the reverse 1‐median problem on a cycle ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Approximating the weight of shallow Steiner trees ⋮ Improving spanning trees by upgrading nodes ⋮ An improved FPTAS for Restricted Shortest Path. ⋮ Approximation algorithms for multi-parameter graph optimization problems
This page was built for publication: The network inhibition problem
