A Discrete and Continuous Study of the Max-Chain-Formation Problem
From MaRDI portal
Publication:6487897
DOI10.1007/978-3-030-64348-5_6zbMath1518.68399MaRDI QIDQ6487897
Peter Kling, Jannik Castenow, Friedhelm Meyer auf der Heide, Till Knollmann
Publication date: 21 March 2023
Analysis of algorithms (68W40) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (3)
A discrete and continuous study of the \textsc{Max-Chain-Formation} problem ⋮ The Max-Line-Formation Problem ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
This page was built for publication: A Discrete and Continuous Study of the Max-Chain-Formation Problem
