Complexity and inapproximability results for the power edge set problem
type: Item
instance of: scholarly article
title: Complexity and inapproximability results for the power edge set problem
zbMATH Open document ID: 1401.90200
author: Sonia Toubaline
author: Claudia D'Ambrosio
author: Leo Liberti
author: Pierre-Louis Poirion
author: Baruch Schieber
author: Hadas Shachnai
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6859594
zbMATH Keywords: PMU placement problem
zbMATH Keywords: power edge set
zbMATH Keywords: NP-hardness
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
full work available at URL: s10878-017-0241-y
OpenAlex ID: W2781398878
cites work: Optimal covering of cacti by vertex-disjoint paths
cites work: Approximation Algorithms and Hardness for Domination with Propagation
cites work: The PMU Placement Problem
cites work: On the hardness of approximating minimum vertex cover
cites work: A note on power domination in grid graphs
cites work: On Syntactic versus Computational Views of Approximability
cites work: Fundamentals of Computation Theory
cites work: Domination in Graphs Applied to Electric Power Networks
cites work: Zero forcing sets and the minimum rank of graphs
cites work: The power edge set problem
cites work: Power domination in block graphs
DOI: 10.1007/S10878-017-0241-Y
Recommended article: Complexity and lowers bounds for power edge set problem
Recommended article: Improved complexity for power edge set problem
Recommended article: New insights for power edge set problem
Recommended article: Approximation hardness of edge dominating set problems
Recommended article: The power edge set problem
Recommended article: Inapproximability of dominating set on power law graphs
Recommended article: On the algorithmic complexity of edge total domination
Recommended article: On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
Recommended article: Hardness Results and Efficient Algorithms for Graph Powers
Recommended article: Q3222861
description: scientific article; zbMATH DE number 6859594