{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:05:27Z","timestamp":1743156327596,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030808785"},{"type":"electronic","value":"9783030808792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80879-2_3","type":"book-chapter","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T08:10:56Z","timestamp":1625472656000},"page":"30-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Algorithms for Matching in Hypergraphs"],"prefix":"10.1007","author":[{"given":"Oussama","family":"Hanguir","sequence":"first","affiliation":[]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abbar, S., Amer-Yahia, S., Indyk, P., Mahabadi, S., Varadarajan, K.R.: Diverse near neighbor problem. In: Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry, pp. 207\u2013214. ACM (2013)","DOI":"10.1145\/2462356.2462401"},{"issue":"4","key":"3_CR2","first-page":"17","volume":"4","author":"KJ Ahn","year":"2018","unstructured":"Ahn, K.J., Guha, S.: Access to data and number of iterations: dual primal algorithms for maximum matching under resource constraints. ACM Trans. Parallel Comput. (TOPC) 4(4), 17 (2018)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algor. 7(4), 567\u2013583 (1986)","journal-title":"J. Algor."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 574\u2013583. ACM (2014)","DOI":"10.1145\/2591796.2591805"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Song, Z., Stein, C., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 674\u2013685. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00070"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Assadi, S., Bateni, M., Bernstein, A., Mirrokni, V., Stein, C.: Coresets meet edcs: algorithms for matching and vertex cover on massive graphs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1616\u20131635. SIAM (2019)","DOI":"10.1137\/1.9781611975482.98"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Assadi, S., Khanna, S.: Randomized composable coresets for matching and vertex cover. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 3\u201312 (2017)","DOI":"10.1145\/3087556.3087581"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: Massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 671\u2013680. ACM (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"3_CR9","unstructured":"Balcan, M.F.F., Ehrlich, S., Liang, Y.: Distributed $$ k $$-means and $$ k $$-median clustering on general topologies. In: Advances in Neural Information Processing Systems, pp. 1995\u20132003 (2013)"},{"key":"3_CR10","first-page":"5","volume":"26","author":"M Bateni","year":"2014","unstructured":"Bateni, M., Bhashkara, A., Lattanzi, S., Mirrokni, V.: Mapping core-sets for balanced clustering. Adv. Neural Inf. Process. Syst. 26, 5\u20138 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. In: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 273\u2013284. ACM (2013)","DOI":"10.1145\/2463664.2465224"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Behnezhad, S., Hajiaghayi, M., Harris, D.G.: Exponentially faster massively parallel maximal matching. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1637\u20131649. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00096"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44985-X_19","volume-title":"Algorithm Theory - SWAT 2000","author":"P Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. In: SWAT 2000. LNCS, vol. 1851, pp. 214\u2013219. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_19"},{"key":"3_CR14","unstructured":"Berman, P., Krysta, P.: Optimizing misdirection. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 192\u2013201. Society for Industrial and Applied Mathematics (2003)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-662-47672-7_14","volume-title":"Automata, Languages, and Programming","author":"A Bernstein","year":"2015","unstructured":"Bernstein, A., Stein, C.: Fully dynamic matching in bipartite graphs. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 167\u2013179. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_14"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Stein, C.: Faster fully dynamic matchings with small approximation ratios. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 692\u2013711. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch50"},{"key":"3_CR17","unstructured":"Bhaskara, A., Rostamizadeh, A., Altschuler, J., Zadimoghaddam, M., Fu, T., Mirrokni, V.: Greedy column subset selection: new bounds and distributed algorithms (2016)"},{"issue":"1\u20132","key":"3_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-011-0451-5","volume":"135","author":"YH Chan","year":"2012","unstructured":"Chan, Y.H., Lau, L.C.: On linear and semidefinite programming relaxations for hypergraph matching. Math. Program. 135(1\u20132), 123\u2013148 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Greedy local improvement and weighted set packing approximation. J. Algor. 39(2), 223\u2013240 (2001)","journal-title":"J. Algor."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013518. IEEE (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Czumaj, A., \u0141acki, J., Madry, A., Mitrovic, S., Onak, K., Sankowski, P.: Round compression for parallel matching algorithms. SIAM J. Comput. (0), STOC18-1 (2019)","DOI":"10.1137\/18M1197655"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Fischer, M., Ghaffari, M., Kuhn, F.: Deterministic distributed edge-coloring via hypergraph maximal matching. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 180\u2013191. IEEE (2017)","DOI":"10.1109\/FOCS.2017.25"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/rsa.3240070104","volume":"7","author":"A Frieze","year":"1995","unstructured":"Frieze, A., Janson, S.: Perfect matchings in random s-uniform hypergraphs. Random Struct. Algor. 7(1), 41\u201357 (1995)","journal-title":"Random Struct. Algor."},{"key":"3_CR24","unstructured":"Furer, M., Yu, H.: Approximate the k-set packing problem by local improvements (2013). arXiv preprint arXiv:1307.2262"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Gouleakis, T., Konrad, C., Mitrovi\u0107, S., Rubinfeld, R.: Improved massively parallel computation algorithms for mis, matching, and vertex cover. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pp. 129\u2013138 (2018)","DOI":"10.1145\/3212734.3212743"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Uitto, J.: Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1636\u20131653. SIAM (2019)","DOI":"10.1137\/1.9781611975482.99"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25591-5_39","volume-title":"Algorithms and Computation","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the mapreduce framework. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 374\u2013383. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25591-5_39"},{"key":"3_CR28","first-page":"160","volume":"95","author":"MM Halld\u00f3rsson","year":"1995","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. SODA 95, 160\u2013169 (1995)","journal-title":"SODA"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Harris, D.G.: Distributed approximation algorithms for maximum matching in graphs and hypergraphs (2018). arXiv preprint arXiv:1807.07645","DOI":"10.1109\/FOCS.2019.00048"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Harvey, N.J., Liaw, C., Liu, P.: Greedy and local ratio algorithms in the mapreduce model. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, pp. 43\u201352 (2018)","DOI":"10.1145\/3210377.3210386"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Compl. 15(1), 20\u201339 (2006)","journal-title":"Comput. Compl."},{"issue":"1","key":"3_CR32","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Disc. Math."},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 100\u2013108. ACM (2014)","DOI":"10.1145\/2594538.2594560"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A Israeli","year":"1986","unstructured":"Israeli, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. Inf. Process. Lett. 22(2), 77\u201380 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching in max snp-complete. Inf. Process. Lett. 37(1), 27\u201335 (1991)","journal-title":"Inf. Process. Lett."},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948. SIAM (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/rsa.10093","volume":"23","author":"JH Kim","year":"2003","unstructured":"Kim, J.H.: Perfect matchings in random uniform hypergraphs. Random Struct. Algor. 23(2), 111\u2013132 (2003)","journal-title":"Random Struct. Algor."},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Moseley, B., Suri, S., Vassilvitskii, S.: Filtering: a method for solving graph problems in mapreduce. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85\u201394. ACM (2011)","DOI":"10.1145\/1989493.1989505"},{"issue":"4","key":"3_CR41","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Zadimoghaddam, M.: Randomized composable core-sets for distributed submodular maximization. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 153\u2013162. ACM (2015)","DOI":"10.1145\/2746539.2746624"},{"key":"3_CR43","unstructured":"Mirzasoleiman, B., Karbasi, A., Sarkar, R., Krause, A.: Distributed submodular maximization: Identifying representative elements in massive data. In: Advances in Neural Information Processing Systems, pp. 2049\u20132057 (2013)"},{"key":"3_CR44","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons Ltd., Hoboken (2003)"},{"issue":"1\u20132","key":"3_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artif Intelligence 135(1\u20132), 1\u201354 (2002)","journal-title":"Artif Intelligence"},{"issue":"1\u20132","key":"3_CR46","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","volume":"111","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohm\u00e9, F.: Coalition structure generation with worst case guarantees. Artif. Intell. 111(1\u20132), 209\u2013238 (1999)","journal-title":"Artif. Intell."},{"issue":"3","key":"3_CR47","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag. 29(3), 93\u201393 (2008)","journal-title":"AI Mag."},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"Shun, J.: Practical parallel hypergraph algorithms. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 232\u2013249 (2020)","DOI":"10.1145\/3332466.3374527"},{"key":"3_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-54256-6","volume-title":"The Algorithm Design Manual","author":"SS Skiena","year":"1998","unstructured":"Skiena, S.S.: The Algorithm Design Manual, vol. 1. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-030-54256-6"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-642-39206-1_67","volume-title":"Automata, Languages, and Programming","author":"M Sviridenko","year":"2013","unstructured":"Sviridenko, M., Ward, J.: Large neighborhood local search for the maximum set packing problem. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 792\u2013803. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_67"},{"key":"3_CR51","doi-asserted-by":"publisher","unstructured":"Vemuganti, R.: Applications of set covering, set packing and set partitioning models: A survey. In: Handbook of Combinatorial Optimization, pp. 573\u2013746. Springer, Heidelberg(1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_9","DOI":"10.1007\/978-1-4613-0303-9_9"},{"issue":"1","key":"3_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80879-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T22:04:39Z","timestamp":1638396279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80879-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030808785","9783030808792"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80879-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2020.di.unipi.it\/WAOA2020\/index.html","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":"40","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":"15","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":"38% - 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.125","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":"5.95","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}