The minimum moving spanning tree problem

DOI10.1007/978-3-030-83508-8_2OpenAlexW3187208706MaRDI QIDQ832829

Luís Fernando Schultz Xavier da Silveira, Prosenjit Bose, Anil Maheshwari, Hugo A. Akitaya, Jean-Lou De Carufel, Ahmad Biniaz, Michiel H. M. Smid

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_2

zbMATH Keywords

minimum spanning treeapproximation algorithmsNP-hardnessconvex distance functionmoving points

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items

The Minimum Moving Spanning Tree Problem

Cites Work

• Unnamed Item
• Some dynamic computational geometry problems
• Transitions in geometric minimum spanning trees
• The Min-Max Spanning Tree Problem and some extensions
• Colored spanning graphs for set visualization
• Kinetic Euclidean minimum spanning tree in the plane
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• Kinetic Pie Delaunay Graph and Its Applications
• Geometric Spanner Networks
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications