Improved Complexity for Power Edge Set Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Improved Complexity for Power Edge Set Problem

Résumé

We study the complexity of Power Edge Set (PES), a problem dedicated to the monitoring of an electric network. In such context we propose some new complexity results. We show that PES remains N P-hard in planar graphs with degree at most five. This result is extended to bipartite planar graphs with degree at most six. We also show that PES is hard to approximate within a factor lower than 328 /325 in the bipartite case (resp. 17/15 −), unless P = N P, (resp. under UGC). We also show that, assuming ET H, there is no 2 o(√ n)-time algorithm and no 2 o(k) n O(1)-time parameterized algorithm, where n is the number of vertices and k the number of PMUs placed. These results improve the current best known bounds.
Fichier principal
Vignette du fichier
IWOCA2017.pdf (470.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01715909 , version 1 (23-02-2018)

Identifiants

Citer

Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller. Improved Complexity for Power Edge Set Problem. IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.128-141, ⟨10.1007/978-3-319-78825-8_11⟩. ⟨hal-01715909⟩
532 Consultations
190 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More