Hardness and approximation for network flow interdiction
From MaRDI portal
Publication:4638580
DOI10.1002/net.21739zbMath1386.90026arXiv1511.02486OpenAlexW2962853446MaRDI QIDQ4638580
Rico Zenklusen, Stephen R. Chestnut
Publication date: 27 April 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02486
multiobjective optimizationapproximation algorithmsnetwork flowhardness of approximationinterdictiondensest \(k\)-subgraph
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Communication networks in operations research (90B18)
Related Items (13)
Interdicting facilities in tree networks ⋮ Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges ⋮ Vertex downgrading to minimize connectivity ⋮ A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid ⋮ On the minimum \(s-t\) cut problem with budget constraints ⋮ Unnamed Item ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Rerouting Flows when Links Fail ⋮ Blocking optimal structures ⋮ The complexity of computing a robust flow ⋮ An approximation algorithm for network flow interdiction with unit costs and two capacities
This page was built for publication: Hardness and approximation for network flow interdiction
