2026-07-22T17:54:04Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19902 2024-05-31T08:33:44Z ddc:004 open_access

Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms Balev, Stefan Pigné, Yoann Sanlaville, Éric Vernet, Mathilde Steiner Tree Dynamic Graph Complexity experimental study This note introduces an extension of the Steiner tree problem applied to dynamic graphs. It discusses its interest, studies its complexity and proposes an algorithm tested on generated and real data. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefan Balev and Yoann Pigné and Éric Sanlaville and Mathilde Vernet 2024 Is Part Of LIPIcs, Volume 292, 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAND.2024.24 urn:nbn:de:0030-drops-199026 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2024.24 eng https://creativecommons.org/licenses/by/4.0/legalcode