A \((B + 1)\)-approximation for network flow interdiction with unit costs

DOI10.1016/J.DAM.2021.07.008zbMATH Open1548.90469MaRDI QIDQ6558673

Clemens Thielen, Jan Boeckmann

Publication date: 20 June 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmnetwork flow interdictioninterdiction problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching interdiction
• The multi-terminal maximum-flow network-interdiction problem
• Deterministic network interdiction
• The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
• An approximation algorithm for network flow interdiction with unit costs and two capacities
• The complexity of computing a robust flow
• Bulk-robust combinatorial optimization
• On the \(p\)-hub interdiction problem
• Detecting high log-densities
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Hardness and approximation for network flow interdiction
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
• Robust and Adaptive Network Flows
• The network inhibition problem
• Max flows in O(nm) time, or better
• Removing Arcs from a Network

This page was built for publication: A \((B + 1)\)-approximation for network flow interdiction with unit costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558673)