Peter Kling
Peter Kling
About
Posts
Publications
Teaching
Contact
Light
Dark
Automatic
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Barbara Kempkes
,
Peter Kling
,
Friedhelm Meyer Auf Der Heide
January 2012
Cite
DOI
URL
Type
Conference paper
Publication
24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ‘12, Pittsburgh, PA, USA, June 25-27, 2012
Related
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
Collisionless Gathering of Robots with an Extent
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
Linear and Competitive Strategies for Continuous Robot Formation Problems
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
Cite
×