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(n logn) algorithm for n participants 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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
BenHassine, A., Ho, T.: An agent-based approach to solve dynamic meeting scheduling problems with preferences. Engineering Applications of Artificial Intelligence 20(6), 857–873 (2007)
Klein, R., Yi, J., Nussbaum, D., Sack, J.-R.: How to Fit in another Meeting. In: 2nd International Conference on Collaborative Computing (CollaborateCom 2006), Atlanta, November 2006, IEEE, Los Alamitos (2006), http://ieeexplore.ieee.org
Matoušek, J.: On Geometric Optimization with Few Violated Constraints. In: Symposium on Computational Geometry, pp. 312–321 (1994)
Megiddo, N.: The weighted Euclidean 1-center problem. Math. Oper. Res. 8, 498–504 (1983)
Radon, J.: Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten. Math. Ann. 83, 113–115 (1921)
Shakshuki, E., Koo, H.-H., Benoit, D., Silver, D.: A distributed multi-agent meeting scheduler. Journal of Computer and System Sciences 74(2), 279–296 (2008)
Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 569–579. Springer, Heidelberg (1992)
Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H.A. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, F., Klein, R., Nussbaum, D., Sack, JR., Yi, J. (2008). A Meeting Scheduling Problem Respecting Time and Space. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)