Advertisement

Speed Dating

An Algorithmic Case Study Involving Matching and Scheduling
  • Bastian Katz
  • Ignaz Rutter
  • Ben Strasser
  • Dorothea Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6630)

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.

Keywords

Approximation Algorithm Bipartite Graph Greedy Algorithm General Speed Karlsruhe Institute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Batagelj, V., Brandes, U.: Efficient generation of large random networks. Physical Review E 036113 (2005)Google Scholar
  2. 2.
    Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM J. Comput. 11(3), 540–546 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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
  4. 4.
    Goldberg, A., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Goldberg, A., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach. 36, 873–886 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Misra, J., Gries, D.: A constructive proof of Vizing’s Theorem. In: Inf. Proc. Let., pp. 131–133 (1992)Google Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Bastian Katz
    • 1
  • Ignaz Rutter
    • 1
  • Ben Strasser
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Faculty of InformaticsKarlsruhe Institute of Technology (KIT)Germany

Personalised recommendations