Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
type: Item
instance of: scholarly article
title: Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
zbMATH Open document ID: 1288.90114
author: Cristina Bazgan
author: Sonia Toubaline
author: Daniel Vanderpooten
published in: Journal of Combinatorial Optimization
publication date: 2013-03-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6148667
zbMATH Keywords: most vital edges and nodes
zbMATH Keywords: min edge and node blocker
zbMATH Keywords: \(p\)-median
zbMATH Keywords: \(p\)-center
zbMATH Keywords: complexity
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: s10878-012-9469-8
OpenAlex ID: W1983163843
cites work: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures
cites work: Q5782525
cites work: On the hardness of approximating minimum vertex cover
cites work: Q4875228
cites work: Some simplified NP-complete graph problems
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: On Syntactic versus Computational Views of Approximability
cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
cites work: Deterministic network interdiction
cites work: Blockers and transversals
DOI: 10.1007/S10878-012-9469-8
description: scientific article; zbMATH DE number 6148667