Skip to main navigation Skip to search Skip to main content

A simple Greedy algorithm for the profit-aware social team formation problem

  • Shengxin Liu
  • , Chung Keung Poon*
  • *Corresponding author for this work
  • City University of Hong Kong
  • Saint Francis University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings
EditorsXiaofeng Gao, Hongwei Du, Meng Han
PublisherSpringer Verlag
Pages379-393
Number of pages15
ISBN (Print)9783319711461
DOIs
StatePublished - 2017
Externally publishedYes
Event11th International Conference on Combinatorial Optimization and Applications, COCOA 2017 - Shanghai, China
Duration: 16 Dec 201718 Dec 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10628 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Combinatorial Optimization and Applications, COCOA 2017
Country/TerritoryChina
CityShanghai
Period16/12/1718/12/17

Fingerprint

Dive into the research topics of 'A simple Greedy algorithm for the profit-aware social team formation problem'. Together they form a unique fingerprint.

Cite this