EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Efficient Algorithm for Power Dominating Set

Thomas Bläsius, Max Göttlicher

Algorithmica · 2025-03 · 87 (3) · 344-376

DOI: 10.1007/s00453-024-01283-8 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithmica, online erschienen am 23.12.2024. Verfasst von Thomas Bläsius und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft, Karlsruher Institut für Technologie (KIT).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The problem Power Dominating Set ( PDS ) is motivated by the placement of phasor measurement units to monitor electrical networks. It asks for a minimum set of vertices in a graph that observes all remaining vertices by exhaustively applying two observation rules. Our contribution is twofold. First, we determine the parameterized complexity of PDS by proving it is W [ P ]-complete when parameterized with respect to the solution size. We note that it was only known to be W [2]-hard before. Our second and main contribution is a new algorithm for PDS that efficiently solves practical instances. Our algorithm consists of two complementary parts. The first is a set of reduction rules for PDS that can also be used in conjunction with previously existing algorithms. The second is an algorithm for solving the remaining kernel based on the implicit hitting set approach. Our evaluation on a set of power grid instances from the literature shows that our solver outperforms previous state-of-the-art solvers for PDS by more than one order of magnitude on average. Furthermore, our algorithm can solve previously unsolved instances of continental scale within a few minutes.

Förderung

  • Deutsche Forschungsgemeinschaft
  • Karlsruher Institut für Technologie (KIT)

Zitieren

APA

Bläsius, T., & Göttlicher, M. (2025). An Efficient Algorithm for Power Dominating Set. Algorithmica, 87(3), 344-376. https://doi.org/10.1007/s00453-024-01283-8

Vancouver

Bläsius T, Göttlicher M. An Efficient Algorithm for Power Dominating Set. Algorithmica. 2025;87(3):344-376. doi:10.1007/s00453-024-01283-8

BibTeX
@article{Blsius2025,
  author = {Bläsius, Thomas and Göttlicher, Max},
  title = {An Efficient Algorithm for Power Dominating Set},
  journal = {Algorithmica},
  year = {2025},
  volume = {87},
  number = {3},
  pages = {344--376},
  doi = {10.1007/s00453-024-01283-8}
}
Kostenlos starten →