A Meeting Scheduling Problem Respecting Time and Space

  • Authors:
  • Florian Berger;Rolf Klein;Doron Nussbaum;Jörg-Rüdiger Sack;Jiehua Yi

  • Affiliations:
  • Institute of Computer Science, University of Bonn, Bonn, Germany 53117;Institute of Computer Science, University of Bonn, Bonn, Germany 53117;School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6;School of Computer Science, Carleton University, Ottawa, Canada K1S 5B6

  • Venue:
  • AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 a solution to the problem instance where each participant has two scheduled meetings separated by a free time interval. In [2], we presented an O(nlogn) algorithm for nparticipants obtained by purely geometrical arguments. Our new approach uses the concept of LP-type problems and leads to a randomized algorithm with expected running time O(n).