The following pages link to The network inhibition problem (Q5248549):
Displaying 50 items.
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Matching interdiction (Q602686) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Efficient algorithms for robustness in resource allocation and scheduling problems (Q818137) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Upgrading \(p\)-median problem on a path (Q894530) (← links)
- Interdiction problems on planar graphs (Q897609) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Bilevel model for adaptive network flow problem (Q1742209) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- Connectivity interdiction (Q1785279) (← links)
- On the power of randomization in network interdiction (Q1785482) (← links)
- An improved FPTAS for Restricted Shortest Path. (Q1853085) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- Scalable attack on graph data by injecting vicious nodes (Q2212510) (← links)
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- Approximating the restricted 1-center in graphs (Q2424875) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Heuristics for multi-stage interdiction of stochastic networks (Q2491320) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- Optimal deployment of virtual network functions for securing telecommunication networks against distributed denial of service attacks: a robust optimization approach (Q2676287) (← links)
- Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Approximating the Restricted 1-Center in Graphs (Q3467877) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- A decomposition algorithm applied to planning the interdiction of stochastic networks (Q4680427) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
- (Q5240194) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
- A linear time algorithm for the reverse 1‐median problem on a cycle (Q5487819) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- A simple efficient approximation scheme for the restricted shortest path problem (Q5945392) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
