Packing Interdiction and Partial Covering Problems

DOI10.1007/978-3-642-36694-9_14zbMath1372.90110OpenAlexW183464634MaRDI QIDQ4910813

Anupam Gupta, Michael Dinitz

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_14

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of game theory (91A80) Approximation algorithms (68W25)

Related Items (13)

Interdicting facilities in tree networks ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Interdiction problems on planar graphs ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Interdiction Games and Monotonicity, with Application to Knapsack Problems ⋮ Blocking optimal arborescences ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ Blocking unions of arborescences ⋮ Connectivity interdiction ⋮ On the hardness of covering-interdiction problems ⋮ A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Approximation algorithms for the covering-type \(k\)-violation linear program

This page was built for publication: Packing Interdiction and Partial Covering Problems