Fully dynamic algorithms for Euclidean Steiner tree

DOI10.1007/978-981-97-0566-5_6MaRDI QIDQ6575381

Gramoz Goranci, Quan Xue, T-H. Hubert Chan, Bo Wang, Shaofeng H.-C. Jiang

Publication date: 19 July 2024

zbMATH Keywords

approximation schemesdynamic algorithmsSteiner tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner problem with edge lengths 1 and 2
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• New approximation algorithms for the Steiner tree problems
• An 11/6-approximation algorithm for the network Steiner problem
• An improved LP-based approximation for steiner tree
• The Power of Dynamic Distance Oracles
• Steiner Trees for Terminals Constrained to Curves
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Dynamic Steiner Tree Problem
• The Complexity of Computing Steiner Minimal Trees
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Improved Approximations for the Steiner Tree Problem
• RNC-approximation algorithms for the steiner problem
• Tighter Bounds for Graph Steiner Tree Approximation
• Online Steiner Tree with Deletions
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• The power of deferral
• The power of recourse for online MST and TSP
• Steiner tree problems

This page was built for publication: Fully dynamic algorithms for Euclidean Steiner tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575381)