Fully dynamic algorithms for Euclidean Steiner tree
From MaRDI portal
Publication:6575381
DOI10.1007/978-981-97-0566-5_6MaRDI QIDQ6575381FDOQ6575381
Authors: T-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue 
Publication date: 19 July 2024
Cites Work
- New approximation algorithms for the Steiner tree problems
- An 11/6-approximation algorithm for the network Steiner problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Improved Approximations for the Steiner Tree Problem
- Tighter Bounds for Graph Steiner Tree Approximation
- Dynamic Steiner Tree Problem
- Steiner tree problems
- An improved LP-based approximation for Steiner tree
- 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
- Title not available (Why is that?)
- The power of deferral: maintaining a constant-competitive Steiner tree online
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- The Steiner problem with edge lengths 1 and 2
- Title not available (Why is that?)
- Steiner Trees for Terminals Constrained to Curves
- RNC-approximation algorithms for the steiner problem
- Combinatorial optimization in VLSI design
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- Online Steiner tree with deletions
- The power of recourse for online MST and TSP
- The Power of Dynamic Distance Oracles
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)
