Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Lehrstuhl fr Informatik 9 Zeit: Donnerstag, 22. Januar 2009, 16.30 Uhr

Summary: Lehrstuhl für Informatik 9
Zeit: Donnerstag, 22. Januar 2009, 16.30 Uhr
Ort: AH I, Ahornstr. 55
Referent: Prof. Nikos Mamoulis, Ph.D.
University of Hong Kong
Titel: Algorithms for Large-Scale Matching Problems
In this talk, I will discuss our research on evaluation of large-scale matching problems. Given
two sets of objects (e.g., a set of cars and a set of parking slots) the goal is to find a one-to-
one matching which satisfies a condition (e.g., stable-marriage property) or maximizes an
objective function (e.g., number of cars in matching, sum of distances between cars and par-
king slots in the matching). Matching problems are found in many applications including as-
signing cars to parking slots, students to schools, customers of a booking service to hotel
rooms, police cars to emergency incidents, mobile devices to WiFi routers, applicants to jobs,
university applicants to degree programmes, etc. Although polynomial algorithms have been
developed for matching problems considering a wide range of objectives, they all suffer from
large space and time requirements. Specifially, all these methods have at least quadratic
time and space complexity, a fact that makes them inapplicable for inputs in the order of mil-
lions. On the other hand, it is not uncommon to find real-life problems of that magnitude.


Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)


Collections: Computer Technologies and Information Sciences