Interdiction Problems on Planar Graphs
From MaRDI portal
Publication:2851866
DOI10.1007/978-3-642-40328-6_23zbMath1405.68449OpenAlexW2953256896MaRDI QIDQ2851866
Publication date: 4 October 2013
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_23
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Connectivity interdiction
This page was built for publication: Interdiction Problems on Planar Graphs