We consider the problem of determining suitable meeting times and locations for a group of participants wishing to schedule a new meeting subject to already scheduled meetings possibly held at a number of different locations. Each participant must be able to reach the new meeting location, attend for the entire duration, and reach the next meeting location on time. In particular, we give two solutions to the problem instance where each participant has two scheduled meetings separated by a free time interval. We present an O (n log n) algorithm for n participants obtained by purely geometrical arguments. Our second approach uses the concept of LP-type problems and leads to a randomized algorithm with expected running time O (n). We also consider a graph-based model where participants belong to different groups and can travel along the edges of a graph. For the meeting, only one member out of each group is required. The resulting problem can be solved using furthest color Voronoi diagrams on graphs.

Additional Metadata
Keywords Algorithms, Computational geometry, Geographic information system, Meeting schedule
Persistent URL dx.doi.org/10.1007/s10707-008-0053-4
Journal GeoInformatica
Citation
Berger, F. (Florian), Klein, R. (Rolf), Nussbaum, D, Sack, J.-R, & Yi, J. (Jiehua). (2009). A meeting scheduling problem respecting time and space. GeoInformatica, 13(4), 453–481. doi:10.1007/s10707-008-0053-4