Online team formation in social networks

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web

Volumn , Issue , 2012, Pages 839-848

  Anagnostopoulos, Aris ^a   Becchetti, Luca ^a   Castillo, Carlos ^b   Gionis, Aristides ^b   Leonardi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (Spain)

Author keywords

Scheduling; Task assignment; Team formation

Indexed keywords

COLLABORATION NETWORK; COMMUNICATION OVERHEADS; COORDINATION COSTS; ON-LINE FASHION; ONLINE TEAMS; SOCIAL NETWORKS; TASK ASSIGNMENT; TEAM COMMUNICATION; TEAM FORMATION; TEAM MEMBERS;

APPROXIMATION ALGORITHMS; COMMUNICATION; SCHEDULING; WORLD WIDE WEB;

SOCIAL NETWORKING (ONLINE);

EID: 84860875663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2187836.2187950     Document Type: Conference Paper

References (22)

1. Knowledge and Data Engineering Group, University of Kassel, Benchmark Folksonomy Data from BibSonomy. 2007.
2. A. Anagnostopoulos, L. Becchetti, C. Castillo, A. Gionis, and S. Leonardi. Power in unity: Forming teams in large-scale community systems. In CIKM, 2010.
3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM, 44(3):486-504, 1997.
4. Y. Azar. On-line load balancing. In Theoret. Comp. Sci., 1992.
5. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In SODA, 1992.
6. C. Chekuri, G. Even, and G. Kortsarz. A greedy approximation algorithm for the group steiner problem. Discrete Applied Mathematics, 154(1):15-34, 2006.
7. R. H. Coase. The Nature of the Firm. Economica, 4(16):386-405, November 1937.
8. C. Dorn and S. Dustdar. Composing near-optimal expert teams: a trade-off between skills and connectivity. In CoopIS, 2010.
9. A. Gajewar and A. D. Sarma. Multi-skill Collaborative Teams based on Densest Subgraphs. In SDM, 2012.
10. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In SODA, 1998.
11. M. E. Gaston and M. des Jardins. Agent-organized networks for dynamic team formation. In AAMAS, 2005.
12. R. L. Graham. Bounds on multiprocessing anomalies and related packing algorithms. In AFIPS, 1972.
13. M. Kargar and A. An. Discovering top-k teams of experts with/without a leader in social networks. In CIKM, 2011.
14. T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, 2009.
15. C.-T. Li and M.-K. Shan. Team Formation for Generalized Tasks in Expertise Social Networks. In SocialCom, 2010.
16. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. JACM, 30, 1983.
17. K. Mehlhorn. Assigning papers to referees. In ICALP, 2009.
18. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In FOCS, 2000.
19. R. Ravi and M. X. Goemans. The constrained minimum spanning tree problem (extended abstract). In SWAT, 1996.
20. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, III. Many birds with one stone: multi-objective approximation algorithms. In STOC, 1993.
21. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2), 1985.
22. V. V. Vazirani. Approximation algorithms. 2001.