Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs

In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider an undirected weighted planar graph G=(V, E) with positive real edge weights and a sequence of updates comprising of edge insertions and deletions. The goal is to maintain a Steiner tree (...

Celý popis

Podrobná bibliografia

Vydané v:	International Symposium on Computing and Networking Workshops (Online) s. 416 - 420
Hlavní autori:	Raikwar, Hemraj, Karmakar, Sushanta
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.11.2022
Predmet:	Approximation algorithms Conferences dynamic distance oracle fully dynamic algorithm Heuristic algorithms Steiner tree Steiner trees Symbols
ISSN:	2832-1324
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!