{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:48:57Z","timestamp":1760168937104,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_41","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"588-603","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Anh Viet","family":"Do","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"volume-title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","year":"2011","key":"41_CR1","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Co., Inc., Singapore (2011)"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Balcan, M.F., Blum, A., Mansour, Y.: Item pricing for revenue maximization. In: Proceedings of the 9th ACM Conference on Electronic Commerce, EC 2008, pp. 50\u201359. ACM, New York (2008). \nhttps:\/\/doi.org\/10.1145\/1386790.1386802","DOI":"10.1145\/1386790.1386802"},{"key":"41_CR3","doi-asserted-by":"publisher","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 700\u2013709. Society for Industrial and Applied Mathematics, Philadelphia (2011). \nhttps:\/\/doi.org\/10.1137\/1.9781611973082.55","DOI":"10.1137\/1.9781611973082.55"},{"key":"41_CR4","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of the 34th International Conference on Machine Learning, ICML 2017, vol. 70, pp. 498\u2013507. JMLR.org (2017)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Garg, M.: Deterministic $$(1\/2 + \\epsilon )$$-approximation for submodular maximization over a matroid. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 241\u2013254. Society for Industrial and Applied Mathematics, Philadelphia (2019)","DOI":"10.1137\/1.9781611975482.16"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 72\u201383. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27821-4_7"},{"issue":"3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discret. Appl. Math. 7(3), 251\u2013274 (1984). \nhttps:\/\/doi.org\/10.1016\/0166-218X(84)90003-9","journal-title":"Discret. Appl. Math."},{"key":"41_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9781118165881","volume-title":"Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach","author":"GW Corder","year":"2009","unstructured":"Corder, G.W., Foreman, D.I.: Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach. Wiley, Hoboken (2009)"},{"issue":"8","key":"41_CR9","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag. Sci. 23(8), 789\u2013810 (1977). \nhttps:\/\/doi.org\/10.1287\/mnsc.23.8.789","journal-title":"Manag. Sci."},{"issue":"6","key":"41_CR10","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G C\u0103linescu","year":"2011","unstructured":"C\u0103linescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011). \nhttps:\/\/doi.org\/10.1137\/080733991","journal-title":"SIAM J. Comput."},{"key":"41_CR11","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th International Conference on International Conference on Machine Learning, ICML 2011, Omnipress, Madison, WI, USA, pp. 1057\u20131064 (2011)"},{"key":"41_CR12","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation - Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Natural Computing Series. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133\u20131153 (2011). \nhttps:\/\/doi.org\/10.1137\/090779346","journal-title":"SIAM J. Comput."},{"key":"41_CR14","doi-asserted-by":"publisher","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 611\u2013620. Society for Industrial and Applied Mathematics, Philadelphia (2006). \nhttps:\/\/doi.org\/10.1145\/1109557.1109624","DOI":"10.1145\/1109557.1109624"},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"Friedrich, T., G\u00f6bel, A., Neumann, F., Quinzan, F., Rothenberger, R.: Greedy maximization of functions with bounded curvature under partition matroid constraints. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2272\u20132279 (2019). \nhttps:\/\/doi.org\/10.1609\/aaai.v33i01.33012272","DOI":"10.1609\/aaai.v33i01.33012272"},{"issue":"4","key":"41_CR16","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models*. Evol. Comput. 18(4), 617\u2013633 (2010). \nhttps:\/\/doi.org\/10.1162\/EVCO_a_00003","journal-title":"Evol. Comput."},{"issue":"4","key":"41_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/EVCO_a_00159","volume":"23","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Neumann, F.: Maximizing submodular functions under matroid constraints by evolutionary algorithms. Evol. Comput. 23(4), 543\u2013558 (2015). \nhttps:\/\/doi.org\/10.1162\/EVCO_a_00159","journal-title":"Evol. Comput."},{"issue":"6","key":"41_CR18","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995). \nhttps:\/\/doi.org\/10.1145\/227683.227684","journal-title":"J. ACM"},{"issue":"4","key":"41_CR19","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761\u2013777 (2001). \nhttps:\/\/doi.org\/10.1145\/502090.502096","journal-title":"J. ACM"},{"key":"41_CR20","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms - The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Natural Computing Series. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17339-4"},{"key":"41_CR21","doi-asserted-by":"publisher","unstructured":"Jegelka, S., Bilmes, J.: Submodularity beyond submodular energies: coupling edges in graph cuts. In: CVPR 2011, pp. 1897\u20131904 (2011). \nhttps:\/\/doi.org\/10.1109\/CVPR.2011.5995589","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"41_CR22","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137\u2013146. ACM, New York (2003). \nhttps:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"41_CR23","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/1989734.1989736","volume":"2","author":"A Krause","year":"2011","unstructured":"Krause, A., Guestrin, C.: Submodularity and its applications in optimized information gathering. ACM Trans. Intell. Syst. Technol. 2(4), 32:1\u201332:20 (2011). \nhttps:\/\/doi.org\/10.1145\/1989734.1989736","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"41_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/1390681.1390689","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9, 235\u2013284 (2008). \nhttps:\/\/doi.org\/10.1145\/1390681.1390689","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"41_CR25","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/TEVC.2004.823470","volume":"8","author":"M Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of multiobjective evolutionary algorithms on pseudo-boolean functidons. IEEE Trans. Evol. Comput. 8(2), 170\u2013182 (2004). \nhttps:\/\/doi.org\/10.1109\/TEVC.2004.823470","journal-title":"IEEE Trans. Evol. Comput."},{"key":"41_CR26","doi-asserted-by":"publisher","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 323\u2013332. ACM, New York (2009). \nhttps:\/\/doi.org\/10.1145\/1536414.1536459","DOI":"10.1145\/1536414.1536459"},{"key":"41_CR27","unstructured":"Lengler, J.: Drift analysis. CoRR abs\/1712.00964 (2017). \nhttp:\/\/arxiv.org\/abs\/1712.00964"},{"key":"41_CR28","unstructured":"Lin, H., Bilmes, J.: Multi-document summarization via budgeted maximization of submodular functions. In: Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, HLT 2010, pp. 912\u2013920. Association for Computational Linguistics, Cambridge (2010)"},{"key":"41_CR29","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, HLT 2011, pp. 510\u2013520. Association for Computational Linguistics, Portland (2011)"},{"key":"41_CR30","doi-asserted-by":"publisher","unstructured":"Liu, Y., Wei, K., Kirchhoff, K., Song, Y., Bilmes, J.: Submodular feature selection for high-dimensional acoustic score spaces. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 7184\u20137188 (2013). \nhttps:\/\/doi.org\/10.1109\/ICASSP.2013.6639057","DOI":"10.1109\/ICASSP.2013.6639057"},{"key":"41_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming the State of the Art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Grotschel, M. (eds.) Mathematical Programming the State of the Art, pp. 235\u2013257. Springer, Heidelberg (1983). \nhttps:\/\/doi.org\/10.1007\/978-3-642-68874-4_10"},{"issue":"3","key":"41_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978). \nhttps:\/\/doi.org\/10.1287\/moor.3.3.177","journal-title":"Math. Oper. Res."},{"key":"41_CR33","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization. Natural Computing Series. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16544-3"},{"key":"41_CR34","doi-asserted-by":"publisher","unstructured":"Qian, C., Shi, J.C., Yu, Y., Tang, K.: On subset selection with general cost constraints. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 2613\u20132619 (2017). \nhttps:\/\/doi.org\/10.24963\/ijcai.2017\/364","DOI":"10.24963\/ijcai.2017\/364"},{"key":"41_CR35","unstructured":"Qian, C., Shi, J.C., Yu, Y., Tang, K., Zhou, Z.H.: Parallel pareto optimization for subset selection. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 1939\u20131945. AAAI Press (2016)"},{"key":"41_CR36","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.artint.2019.06.005","volume":"275","author":"C Qian","year":"2019","unstructured":"Qian, C., Yu, Y., Tang, K., Yao, X., Zhou, Z.H.: Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. Artif. Intell. 275, 279\u2013294 (2019). \nhttps:\/\/doi.org\/10.1016\/j.artint.2019.06.005","journal-title":"Artif. Intell."},{"key":"41_CR37","unstructured":"Queyranne, M.: A combinatorial algorithm for minimizing symmetric submodular functions. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 98\u2013101. Society for Industrial and Applied Mathematics, Philadelphia (1995)"},{"key":"41_CR38","unstructured":"Stobbe, P., Krause, A.: Efficient minimization of decomposable submodular functions. In: Proceedings of the 23rd International Conference on Neural Information Processing Systems, NIPS 2010, vol. 2, pp. 2208\u20132216. Curran Associates Inc., New York (2010)"},{"key":"41_CR39","doi-asserted-by":"publisher","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 211\u2013220. ACM, New York (2013). \nhttps:\/\/doi.org\/10.1145\/2488608.2488635","DOI":"10.1145\/2488608.2488635"},{"key":"41_CR40","unstructured":"Vondr\u00e1k, J.: Submodularity and curvature: the optimal algorithm. RIMS K\u00f4ky\u00fbroku Bessatsu B23, pp. 253\u2013266 (2010)"},{"key":"41_CR41","unstructured":"Wei, K., Iyer, R., Bilmes, J.: Submodularity in data subset selection and active learning. In: Proceedings of the 32nd International Conference on International Conference on Machine Learning, ICML 2015, vol. 37, pp. 1954\u20131963. JMLR.org (2015)"},{"key":"41_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9","volume-title":"Evolutionary Learning: Advances in Theories and Algorithms","author":"Z Zhou","year":"2019","unstructured":"Zhou, Z., Yu, Y., Qian, C.: Evolutionary Learning: Advances in Theories and Algorithms. Springer, Singapore (2019). \nhttps:\/\/doi.org\/10.1007\/978-981-13-5956-9"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:09:04Z","timestamp":1598998144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}