Computing the minimum bottleneck moving spanning tree

DOI10.1007/S00453-025-01358-0MaRDI QIDQ6894400zbMATH OpenFDO

Authors Haitao Wang, Yiming Zhao

Publication date 25 November 2025

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treedynamic data structuremoving pointsunit-disk range emptiness query

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1507300 (Why is no real title available?)
• scientific article; zbMATH DE number 6861957 (Why is no real title available?)
• scientific article; zbMATH DE number 7236428 (Why is no real title available?)
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• An Expander-Based Approach to Geometric Optimization
• Applications of a semi-dynamic convex hull algorithm
• Data Structures for Mobile Data
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Dynamic geometric data structures via shallow cuttings
• Dynamic half-space range reporting and its applications
• Dynamic planar convex hull operations in near-logarithmic amortized time
• Efficient partition trees
• Geometry helps in bottleneck matching and related problems
• Kinetic Euclidean minimum spanning tree in the plane
• Maintenance of configurations in the plane
• Near-optimal algorithms for shortest paths in weighted unit-disk graphs
• Optimal partition trees
• Range searching with efficient hierarchical cuttings
• Reverse shortest path problem for unit-disk graphs
• Reverse shortest path problem in weighted unit-disk graphs
• Shortest paths in intersection graphs of unit disks
• The Min-Max Spanning Tree Problem and some extensions
• The Minimum Moving Spanning Tree Problem
• Unit disk graphs
• Unit-disk range searching and applications
• Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications

This page was built for publication: Computing the minimum bottleneck moving spanning tree

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