Subj : Re: Algorithms for meeting plan
To   : comp.programming
From : CBFalconer
Date : Wed Jul 13 2005 12:11 pm

Andres Baravalle wrote:
> 
> any suggestion for a good algorithm for a multiple meeting planner?
> 
> The constraints are:
> -each participant defines slots of time when s/he is available
> -each participant defines the other participants that s/he wants to see
> 
> the algorithm should return the best plan to satisfy the most
> participants possible.

Look up the stable marriage problem.  Wirth has a good exposition
in "Data Structures + Algorithms = Programs".

-- 
"If you want to post a followup via groups.google.com, don't use
 the broken "Reply" link at the bottom of the article.  Click on 
 "show options" at the top of the article, then click on the 
 "Reply" at the bottom of the article headers." - Keith Thompson

.