The Minimum Moving Spanning Tree Problem
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luı́s Fernando Schultz Xavier da Silveira, Michiel Smid
Abstract
Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luı́s Fernando Schultz Xavier da Silveira, Michiel Smid
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Euclidean minimum spanning tree, Spanning tree, Minimum spanning tree, k-minimum spanning tree, Bottleneck, Combinatorics, Mathematics, Tree (set theory)