The network inhibition problem
From MaRDI portal
Cited in
(58)- Up- and downgrading the 1-center in a network
- Approximating the weight of shallow Steiner trees
- Weight reduction problems with certain bottleneck objectives.
- Approximation algorithms for multi-parameter graph optimization problems
- Upgrading the 1-center problem with edge length variables on a tree
- Upgrading min-max spanning tree problem under various cost functions
- Protection of flows under targeted attacks
- Bilevel model for adaptive network flow problem
- Parametric multiroute flow and its application to multilink-attack network
- Connectivity interdiction
- On the power of randomization in network interdiction
- An improved FPTAS for Restricted Shortest Path.
- Models and methods for solving the problem of network vulnerability
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Interdicting facilities in tree networks
- Scalable attack on graph data by injecting vicious nodes
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- A survey of network interdiction models and algorithms
- Depletable channels: dynamics, behaviour, and efficiency in network design
- Approximating the restricted 1-center in graphs
- The subdivision-constrained routing requests problem
- Heuristics for multi-stage interdiction of stochastic networks
- Bounded-hops power assignment in ad hoc wireless networks
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach
- Bottleneck capacity expansion problems with general budget constraints
- Theoretical and computational advances for network diversion
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Approximating the Restricted 1-Center in Graphs
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
- Improving spanning trees by upgrading nodes
- A decomposition algorithm applied to planning the interdiction of stochastic networks
- Maximum probability shortest path problem
- Multilevel approaches for the critical node problem
- Analysis of budget for interdiction on multicommodity network flows
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Routing of electric vehicles: constrained shortest path problems with resource recovering nodes
- Approximation Algorithms for k-Hurdle Problems
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Upgrading bottleneck constrained forests
- A simple efficient approximation scheme for the restricted shortest path problem
- Matching interdiction
- Vertex downgrading to minimize connectivity
- How vulnerable is an undirected planar graph with respect to max flow
- Robust flows with adaptive mitigation
- How vulnerable is an undirected planar graph with respect to max flow
- Approximation algorithms for \(k\)-hurdle problems
- A (B + 1)-approximation for network flow interdiction with unit costs
- The all-pairs vitality-maximization (VIMAX) problem
- Vital edges for (s,t)-mincut: efficient algorithms, compact structures, \& optimal sensitivity oracles
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
- Some upgrading problems on networks related to eccentricity concept
- Efficient algorithms for robustness in resource allocation and scheduling problems
- Optimizing cost flows by edge cost and capacity upgrade
- Upgrading \(p\)-median problem on a path
- Interdiction problems on planar graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
This page was built for publication: The network inhibition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248549)
