The minimum moving spanning tree problem

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

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

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

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

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)