The kissing problem: how to end a gathering when everyone kisses everyone else goodbye

DOI10.1007/S00224-013-9484-XzbMATH Open1303.68152OpenAlexW1976694430MaRDI QIDQ489765FDOQ489765

Authors: Michael A. Bender, Ritwik Bose, Samuel McCauley, Rezaul Alam Chowdhury 

Publication date: 21 January 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9484-x

Recommendations

• The Kissing Number of the Square
• New formulations for the Kissing Number Problem
• Forming all pairs in a minimal number of steps
• An efficient algorithm for the “stable roommates” problem
• The rendezvous problem on discrete locations

zbMATH Keywords

algorithmscommunicationapproximation algorithmsroutingblock slidingkissing problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Cites Work

• Deterministic rendezvous in graphs
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Title not available (Why is that?)
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Title not available (Why is that?)
• Rendezvous search on labeled networks
• On the computational power of oblivious robots
• Gathering of asynchronous robots with limited visibility
• How to meet in anonymous network
• Title not available (Why is that?)
• Graph puzzles, homotopy, and the alternating group
• Games, puzzles, and computation
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Constructing fair round robin tournaments with a minimum number of breaks
• Approximation algorithms for the Geometric Covering Salesman Problem
• Coordination without communication: the case of the flocking problem
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Title not available (Why is that?)
• Parallel sorting in two-dimensional VLSI models of computation
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Rendezvous search on a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Excuse me! or the courteous theatregoers' problem

This page was built for publication: The kissing problem: how to end a gathering when everyone kisses everyone else goodbye

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489765)