Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 036113 (2005)
Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM J. Comput. 11(3), 540–546 (1982)
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)
Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)
Goldberg, A., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach. 36, 873–886 (1989)
Misra, J., Gries, D.: A constructive proof of Vizing’s Theorem. In: Inf. Proc. Let., pp. 131–133 (1992)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz, pp. 25–30 (1964) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katz, B., Rutter, I., Strasser, B., Wagner, D. (2011). Speed Dating. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)