Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Frontier-based exploration using multiple robots
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Coordination for Multi-Robot Exploration and Mapping
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Behavior-Based Coordination of Large-Scale Robot Formations
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Theoretical Computer Science - Game theory meets theoretical computer science
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Games, Puzzles, and Computation
Games, Puzzles, and Computation
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the computational power of oblivious robots: forming a series of geometric patterns
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
This paper introduces the kissing problem: given a rectangular room with n people in it, what is the most efficient way for each pair of people to kiss each other goodbye? The room is viewed as a set of pixels that form a subset of the integer grid. At most one person can stand on a pixel at once, and people move horizontally or vertically. In order to move into a pixel in time step t, the pixel must be empty in time step t−1. The paper gives one algorithm for kissing everyone goodbye. (1) This algorithm is a 4 + o(1)-approximation algorithm in a crowded room (e.g., only one unoccupied pixel). (2) It is a 10 + o(1)-approximation algorithm for kissing in a comfortable room (e.g., at most half the pixels are empty). (3) It is a 25+o(1)-approximation for kissing in a sparse room.