Complexity and inapproximability results for the power edge set problem

DOI10.1007/s10878-017-0241-yzbMath1401.90200OpenAlexW2781398878MaRDI QIDQ1743493

Pierre-Louis Poirion, Claudia D'Ambrosio, Sonia Toubaline, Baruch Schieber, Hadas Shachnai, Leo Liberti

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0241-y

zbMATH Keywords

NP-hardnessinapproximabilitypower edge setPMU placement problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• On the hardness of approximating minimum vertex cover
• Optimal covering of cacti by vertex-disjoint paths
• Zero forcing sets and the minimum rank of graphs
• A note on power domination in grid graphs
• Power domination in block graphs
• On Syntactic versus Computational Views of Approximability
• The power edge set problem
• Domination in Graphs Applied to Electric Power Networks
• The PMU Placement Problem
• Fundamentals of Computation Theory
• Approximation Algorithms and Hardness for Domination with Propagation

This page was built for publication: Complexity and inapproximability results for the power edge set problem