Please use this identifier to cite or link to this item:
https://repository.cihe.edu.hk/jspui/handle/cihe/450
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Poon, Chung Keung | - |
dc.contributor.other | Liu, S. | - |
dc.date.accessioned | 2021-03-29T09:12:28Z | - |
dc.date.available | 2021-03-29T09:12:28Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | https://repository.cihe.edu.hk/jspui/handle/cihe/450 | - |
dc.description.abstract | Team formation in social networks has attracted much attention due to its many applications such as the online labour market. In this paper, we focus on the problem of forming multiple teams of experts with diverse skills in social network to accomplish complex tasks of required skills. The goal is to maximize the total profit of tasks that these teams can complete. We provide a simple and practical algorithm that improves upon previous results in many situations. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.title | A simple greedy algorithm for the profit-aware social team formation problem | en_US |
dc.type | conference proceedings | en_US |
dc.relation.publication | Combinatorial Optimization and Applications (11th International Conference, COCOA 2017) Proceedings, Part II | en_US |
dc.contributor.affiliation | School of Computing and Information Sciences | - |
dc.relation.isbn | 9783319711461 | en_US |
dc.description.startpage | 379 | en_US |
dc.description.endpage | 393 | en_US |
dc.cihe.affiliated | Yes | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
item.openairetype | conference proceedings | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Yam Pak Charitable Foundation School of Computing and Information Sciences | - |
Appears in Collections: | CIS Publication |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.