On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Modeling Moving Objects over Multiple Granularities
Annals of Mathematics and Artificial Intelligence
Developing an Automated Distributed Meeting Scheduler
IEEE Expert: Intelligent Systems and Their Applications
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Getting from here to there: interactive planning and agent execution for optimizing travel
Eighteenth national conference on Artificial intelligence
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
An Efficient and Privacy-Aware Meeting Scheduling Scheme Using Common Computational Space
IEICE - Transactions on Information and Systems
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Engineering Applications of Artificial Intelligence
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
A distributed multi-agent meeting scheduler
Journal of Computer and System Sciences
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Scheduling meetings in distance learning
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
The timetable constrained distance minimization problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Privacy in mobile computing for location-sharing-based services
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
| Hi-index | 0.00 |
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 logn) 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.