In this paper we formalize and solve the speed dating problem. This problem arises in the context of speed dating events, where several people come together to date each other for a short time. For larger events of this type it is not possible to have each possible pair of persons meet. Instead, based on forms filled out by the participants, the organizer of such an event decides in advance, which pairs of people should meet and also schedules the times of their dates. Moreover, since people pay for participating in such events, aside from the overall quality of the dates, it is important to find a fair schedule, where people from the same group (e.g., all women) have a comparable number of dates.
We model the organizer’s problem for speed dating, study its complexity and design efficient algorithms for solving it. Finally, we present an experimental evaluation and show that our algorithms are indeed able to solve realistic problem instances within a reasonable time frame.
KeywordsApproximation Algorithm Bipartite Graph Greedy Algorithm General Speed Karlsruhe Institute
Unable to display preview. Download preview PDF.
- 1.Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 036113 (2005)Google Scholar
- 3.Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. 15th Annu. ACM Sympos. Theor. Comput(STOC 1983), pp. 448–456. ACM, New York (1983)Google Scholar
- 6.Misra, J., Gries, D.: A constructive proof of Vizing’s Theorem. In: Inf. Proc. Let., pp. 131–133 (1992)Google Scholar
- 7.Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz, pp. 25–30 (1964) (in Russian)Google Scholar