The minimum moving spanning tree problem

DOI10.1007/978-3-030-83508-8_2MaRDI QIDQ832829zbMATH OpenOpenAlexFDO

Authors Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel 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

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A framework for algorithm stability and its application to kinetic Euclidean MSTs
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Colored spanning graphs for set visualization
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Geometric Spanner Networks
• Kinetic Euclidean minimum spanning tree in the plane
• Kinetic pie Delaunay graph and its applications
• Some dynamic computational geometry problems
• The Min-Max Spanning Tree Problem and some extensions
• Transitions in geometric minimum spanning trees

Cited in

(2)

• The Minimum Moving Spanning Tree Problem
• The Minimum Spanning Tree Problem with Time Window Constraints

This page was built for publication: The minimum moving spanning tree problem

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