Name
Abstract | ||
|---|---|---|
Consider a group of people who are visiting a major touristic city, such as NY, Paris, or Rome. It is reasonable to assume that each member of the group has his or her own interests or preferences about places to visit, which in general may differ from those of other members. Still, people almost always want to hang out together and so the following question naturally arises: This problem underpins several challenges, ranging from understanding people’s expected attitudes towards potential points of interest, to modeling and providing good and viable solutions. Formulating this problem is challenging because of multiple competing objectives. For example, making the entire group as happy as possible in general conflicts with the objective that no member becomes disappointed. In this paper, we address the algorithmic implications of the above problem, by providing various formulations that take into account the overall group as well as the individual satisfaction and the length of the tour. We then study the computational complexity of these formulations, we provide effective and efficient practical algorithms, and, finally, we evaluate them on datasets constructed from real city data. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s10618-016-0477-7 | Data Min. Knowl. Discov. |
Keywords | Field | DocType |
Group recommendation,Tour recommendation for groups,Orienteering problem | Social group,Data mining,Computer science,Operations research,Hang,Point of interest,Computational complexity theory | Journal |
Volume | Issue | ISSN |
31 | 5 | 1384-5810 |
Citations | PageRank | References |
6 | 0.41 | 35 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aris Anagnostopoulos | 1 | 1054 | 67.08 |
| Reem Atassi | 2 | 6 | 0.41 |
| Luca Becchetti | 3 | 6 | 0.75 |
| Adriano Fazzone | 4 | 12 | 2.88 |
| Fabrizio Silvestri | 5 | 1819 | 107.29 |