On the hardness of covering-interdiction problems
type: Item
instance of: scholarly article
title: On the hardness of covering-interdiction problems
zbMATH Open document ID: 1503.68219
author: Nicolas Fröhlich
author: Stefan Ruzika
published in: Theoretical Computer Science
publication date: 2021-06-08T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91B72
zbMATH DE Number: 7356469
zbMATH Keywords: location planning
zbMATH Keywords: network interdiction
zbMATH Keywords: complexity
zbMATH Keywords: polynomial hierarchy
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.04.007
OpenAlex ID: W3153827225
cites work: The Maximum Coverage Location Problem
cites work: Computational Complexity
cites work: Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
cites work: Packing Interdiction and Partial Covering Problems
cites work: Interdiction problems on planar graphs
cites work: Network flow interdiction on planar graphs
cites work: The budget constrained \(r\)-interdiction median problem with capacity expansion
cites work: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
cites work: Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
cites work: Most vital links and nodes in weighted networks
cites work: Finding the most vital arcs in a network
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
DOI: 10.1016/J.TCS.2021.04.007
description: scientific article; zbMATH DE number 7356469