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 (...

Full description

Bibliographic Details

Published in:	International Symposium on Computing and Networking Workshops (Online) pp. 416 - 420
Main Authors:	Raikwar, Hemraj, Karmakar, Sushanta
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2022
Subjects:	Approximation algorithms Conferences dynamic distance oracle fully dynamic algorithm Heuristic algorithms Steiner tree Steiner trees Symbols
ISSN:	2832-1324
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!