Complexity and inapproximability results for the Power Edge Set problem
Open Access
- 27 December 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 895-905
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The power edge set problemNetworks, 2016
- Taxonomy of PMU Placement MethodologiesIEEE Transactions on Power Systems, 2012
- Robust Measurement Design by Placing Synchronized Phasor Measurements on Network BranchesIEEE Transactions on Power Systems, 2009
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- A note on power domination in grid graphsDiscrete Applied Mathematics, 2006
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- The PMU Placement ProblemSIAM Journal on Discrete Mathematics, 2005
- Domination in Graphs Applied to Electric Power NetworksSIAM Journal on Discrete Mathematics, 2002
- On Syntactic versus Computational Views of ApproximabilitySIAM Journal on Computing, 1998
- Optimal covering of cacti by vertex-disjoint pathsTheoretical Computer Science, 1991