{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:07:51Z","timestamp":1768972071442,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319468815","type":"print"},{"value":"9783319468822","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46882-2_2","type":"book-chapter","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T15:00:03Z","timestamp":1474642803000},"page":"14-29","source":"Crossref","is-referenced-by-count":13,"title":["Evaluating the Efficiency of Robust Team Formation Algorithms"],"prefix":"10.1007","author":[{"given":"Chad","family":"Crawford","sequence":"first","affiliation":[]},{"given":"Zenefa","family":"Rahaman","sequence":"additional","affiliation":[]},{"given":"Sandip","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,24]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-33090-2_14","volume-title":"Algorithms \u2013 ESA 2012","author":"Nikhil Bansal","year":"2012","unstructured":"Bansal, Nikhil, Pruhs, Kirk: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling. In: Epstein, Leah, Ferragina, Paolo (eds.) ESA 2012. LNCS, vol. 7501, pp. 145\u2013156. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33090-2_14"},{"issue":"3","key":"2_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). INFORMS","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2_CR3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). IEEE","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial proble. In: Proceedings of the Fifth Annual ACM Symposium on Theory of computing, pp. 38\u201349. ACM (1973)","DOI":"10.1145\/800125.804034"},{"key":"2_CR5","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, US (1972). doi: 10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Kitano, H.: RoboCup rescue: a grand challenge for multi-agent systems. In: 2000 Proceedings Fourth International Conference on MultiAgent Systems, pp. 5\u201312 (2000). doi: 10.1109\/ICMAS.2000.858425","DOI":"10.1109\/ICMAS.2000.858425"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 467\u2013476. ACM, New York (2009). doi: 10.1145\/1557019.1557074","DOI":"10.1145\/1557019.1557074"},{"issue":"4","key":"2_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"2_CR9","unstructured":"Bachrach, Y., Kohli, P., Kolmogorov, V., Zadimoghaddam, M.: Optimal coalition structure generation in cooperative graph games. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2013, pp. 81\u201387. AAAI Press (2013). http:\/\/dl.acm.org\/citation.cfm?id=2891460.2891472"},{"key":"2_CR10","unstructured":"Marcolino, L.S., Jiang, A.X., Tambe, M.: Multi-agent team formation: diversity beats strength?. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 279\u2013285. AAAI Press (2013)"},{"key":"2_CR11","unstructured":"Bachrach, Y., Rosenschein, J.S.: Coalitional skill games. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 2, pp. 1023\u20131030. International Foundation for Autonomous Agents and Multiagent Systems (2008)"},{"issue":"4","key":"2_CR12","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998). ACM","journal-title":"J. ACM (JACM)"},{"issue":"38","key":"2_CR13","doi-asserted-by":"crossref","first-page":"3882","DOI":"10.1016\/j.tcs.2009.05.020","volume":"410","author":"Q-S Hua","year":"2009","unstructured":"Hua, Q.-S., Wang, Y., Yu, D., Lau, F.C.M.: Set multi-covering via inclusion-exclusion. Theoret. Comput. Sci. 410(38), 3882\u20133892 (2009). Elsevier","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hua, Q.-S., Yu, D., Lau, F.C.M., Wang, Y.: Exact algorithms for set multicover and multiset multicover problems. In: Algorithms and Computation, pp. 34\u201344. Springer (2009)","DOI":"10.1007\/978-3-642-10631-6_6"},{"issue":"26","key":"2_CR15","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1016\/j.tcs.2010.02.016","volume":"411","author":"Q-S Hua","year":"2010","unstructured":"Hua, Q.-S., Wang, Y., Yu, D., Lau, F.C.M.: Dynamic programming based algorithms for set multicover and multiset multicover problems. Theor. Comput. Sci. 411(26), 2467\u20132474 (2010). Elsevier","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","unstructured":"Mitchell, S., OSullivan, M., Dunning, I.: PuLP: a linear programming toolkit for python. In: The University of Auckland, Auckland, New Zealand, http:\/\/www. optimization-online.org\/DB_FILE\/2011\/09\/3178. pdf (2011)"},{"key":"2_CR17","unstructured":"Okimoto, T., Schwind, N., Clement, M., Ribeiro, T., Inoue, K., Marquis, P.: How to form a task-oriented robust team. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 395\u2013403. International Foundation for Autonomous Agents and Multiagent Systems (2015)"},{"issue":"4","key":"2_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365\u2013374 (1987). Springer","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"2_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O Shehory","year":"1998","unstructured":"Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artif. Intell. 101(1\u20132), 165\u2013200 (1998). doi: 10.1016\/S0004-3702(98)00045-9","journal-title":"Artif. Intell."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TEM.2004.826011","volume":"51","author":"S-J Chen","year":"2004","unstructured":"Chen, S.-J., Lin, L.: Modeling team member characteristics for the formation of a multifunctional team in concurrent engineering. IEEE Trans. Eng. Manage. 51(2), 111\u2013124 (2004). doi: 10.1109\/TEM.2004.826011","journal-title":"IEEE Trans. Eng. Manage."},{"key":"2_CR21","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media (2013)"},{"issue":"5","key":"2_CR22","doi-asserted-by":"publisher","first-page":"9121","DOI":"10.1016\/j.eswa.2008.12.031","volume":"36","author":"H Wi","year":"2009","unstructured":"Wi, H., Oh, S., Mun, J., Jung, M.: A team formation model based on knowledge and collaboration. Expert Syst. Appl. 36(5), 9121\u20139134 (2009). doi: 10.1016\/j.eswa.2008.12.031","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1007580823003","volume":"31","author":"A Zzkarian","year":"1999","unstructured":"Zzkarian, A., Kusiak, A.: Forming teams: an analytical approach. IIE Trans. 31(1), 85\u201397 (1999). doi: 10.1023\/A:1007580823003","journal-title":"IIE Trans."},{"key":"2_CR24","unstructured":"Chakrabarty, D.: Approximation via Randomized Rounding. University of Pennsylvania (2010). http:\/\/research.microsoft.com\/en-us\/um\/people\/dechakr\/Courses\/CIS800\/Notes\/lec7.pdf"}],"container-title":["Lecture Notes in Computer Science","Autonomous Agents and Multiagent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46882-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T23:31:46Z","timestamp":1568417506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46882-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319468815","9783319468822"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46882-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}