Online team formation in social networks
暂无分享,去创建一个
Luca Becchetti | Aristides Gionis | Stefano Leonardi | Carlos Castillo | Aris Anagnostopoulos | A. Gionis | L. Becchetti | S. Leonardi | C. Castillo | A. Anagnostopoulos
[1] Atish Das Sarma,et al. Multi-skill Collaborative Teams based on Densest Subgraphs , 2011, SDM.
[2] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[3] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[4] Marie desJardins,et al. Agent-organized networks for dynamic team formation , 2005, AAMAS '05.
[5] Guy Kortsarz,et al. A greedy approximation algorithm for the group Steiner problem , 2006, Discret. Appl. Math..
[6] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[7] R. Ravi,et al. Many birds with one stone: multi-objective approximation algorithms , 1993, STOC '93.
[8] Aijun An,et al. Discovering top-k teams of experts with/without a leader in social networks , 2011, CIKM '11.
[9] Luca Becchetti,et al. Power in unity: forming teams in large-scale community systems , 2010, CIKM.
[10] Theodoros Lappas,et al. Finding a team of experts in social networks , 2009, KDD.
[11] P. Strevens. Iii , 1985 .
[12] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[13] R. Ravi,et al. A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.
[14] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[15] R. Ravi,et al. The Constrained Minimum Spanning Tree Problem (Extended Abstract) , 1996, SWAT.
[16] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[17] Kurt Mehlhorn,et al. Assigning Papers to Referees , 2009, Algorithmica.
[18] Cheng-Te Li,et al. Team Formation for Generalized Tasks in Expertise Social Networks , 2010, 2010 IEEE Second International Conference on Social Computing.
[19] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).
[20] Schahram Dustdar,et al. Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity , 2010, OTM Conferences.
[21] Joan V. Robinson,et al. The Nature of the Firm , 2004 .
[22] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.