Fully dynamic algorithms for Euclidean Steiner tree

DOI10.1007/978-981-97-0566-5_6MaRDI QIDQ6575381zbMATH OpenFDO

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

Publication date 19 July 2024

zbMATH Keywords

approximation schemesSteiner treedynamic algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 1305435 (Why is no real title available?)
• An 11/6-approximation algorithm for the network Steiner problem
• An improved LP-based approximation for Steiner tree
• Combinatorial optimization in VLSI design
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Dynamic Steiner Tree Problem
• 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
• New approximation algorithms for the Steiner tree problems
• Online Steiner tree with deletions
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• RNC-approximation algorithms for the steiner problem
• Steiner Trees for Terminals Constrained to Curves
• Steiner tree problems
• The Complexity of Computing Steiner Minimal Trees
• The Power of Dynamic Distance Oracles
• The Steiner problem with edge lengths 1 and 2
• The power of deferral: maintaining a constant-competitive Steiner tree online
• The power of recourse for online MST and TSP
• Tighter Bounds for Graph Steiner Tree Approximation

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)