{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:18:21Z","timestamp":1742948301879,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031700842"},{"type":"electronic","value":"9783031700859"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-70085-9_5","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:54Z","timestamp":1725663774000},"page":"68-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Many-Objective Cover Problem: Discovering Few Solutions to\u00a0Cover Many Objectives"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5926-863X","authenticated-orcid":false,"given":"Yilu","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0412-6335","authenticated-orcid":false,"given":"Chengyu","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-6893","authenticated-orcid":false,"given":"Xi","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"8","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.3390\/electronics9081295","volume":"9","author":"M Ahmed","year":"2020","unstructured":"Ahmed, M., Seraj, R., Islam, S.M.S.: The k-means algorithm: a comprehensive survey and performance evaluation. Electronics 9(8), 1295 (2020)","journal-title":"Electronics"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020)","journal-title":"IEEE Access"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Brockhoff, D., Wagner, T., Trautmann, H.: On the properties of the R2 indicator. In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation, pp. 465\u2013472 (2012)","DOI":"10.1145\/2330163.2330230"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01442131","volume":"4","author":"Y Censor","year":"1977","unstructured":"Censor, Y.: Pareto optimality in multiobjective problems. Appl. Math. Optim. 4(1), 41\u201359 (1977)","journal-title":"Appl. Math. Optim."},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TEVC.2021.3103386","volume":"26","author":"W Chen","year":"2021","unstructured":"Chen, W., Ishibuchi, H., Shang, K.: Fast greedy subset selection from large candidate solution sets in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 26(4), 750\u2013764 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2014","unstructured":"Cheng, R., Jin, Y.: A competitive swarm optimizer for large scale optimization. IEEE Trans. Cybern. 45(2), 191\u2013204 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ins.2014.08.039","volume":"291","author":"R Cheng","year":"2015","unstructured":"Cheng, R., Jin, Y.: A social learning particle swarm optimization algorithm for scalable optimization. Inf. Sci. 291, 43\u201360 (2015)","journal-title":"Inf. Sci."},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng, R., Jin, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(5), 773\u2013791 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng, R., Li, M., Tian, Y., Zhang, X., Yang, S., Jin, Y., Yao, X.: A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3, 67\u201381 (2017)","journal-title":"Complex Intell. Syst."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TEVC.2016.2622301","volume":"22","author":"T Chugh","year":"2016","unstructured":"Chugh, T., Jin, Y., Miettinen, K., Hakanen, J., Sindhya, K.: A surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive many-objective optimization. IEEE Trans. Evol. Comput. 22(1), 129\u2013142 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58\u201373 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"5_CR12","first-page":"29","volume":"149","author":"O Cuate","year":"2020","unstructured":"Cuate, O., Sch\u00fctze, O.: Pareto explorer for solving real world applications. Res. Comput. Sci. 149(3), 29\u201336 (2020)","journal-title":"Res. Comput. Sci."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary Multiobjective Optimization: Theoretical Advances and Applications, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6","DOI":"10.1007\/1-84628-137-7_6"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics, pp. 439\u2013485 (2005)","DOI":"10.4007\/annals.2005.162.439"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Mach. Learn. 56, 9\u201333 (2004)","journal-title":"Mach. Learn."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Duro, J.A., Saxena, D.K.: Timing the decision support for real-world many-objective optimization problems. In: Proceedings of the Evolutionary Multi-Criterion Optimization, pp. 191\u2013205 (2017)","DOI":"10.1007\/978-3-319-54157-0_14"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F Grandoni","year":"2006","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4(2), 209\u2013214 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TEVC.2023.3261134","volume":"28","author":"YR Gu","year":"2023","unstructured":"Gu, Y.R., Bian, C., Li, M., Qian, C.: Subset selection for evolutionary multi-objective optimization. IEEE Trans. Evol. Comput. 28(2), 403\u2013417 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3453474","volume":"54","author":"AP Guerreiro","year":"2021","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: The hypervolume indicator: computational problems and algorithms. ACM Comput. Surv. 54(6), 1\u201342 (2021)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/S0097539704444750","volume":"35","author":"R Hassin","year":"2005","unstructured":"Hassin, R., Levin, A.: A better-than-greedy approximation algorithm for the minimum set cover problem. SIAM J. Comput. 35(1), 189\u2013200 (2005)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR22","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"5_CR23","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","volume":"22","author":"H Ishibuchi","year":"2018","unstructured":"Ishibuchi, H., Imada, R., Setoguchi, Y., Nojima, Y.: Reference point specification in inverted generational distance for triangular linear Pareto front. IEEE Trans. Evol. Comput. 22(6), 961\u2013975 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Jaimes, A.L., Oyama, A., Fujii, K.: Space trajectory design: Analysis of a real-world many-objective optimization problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 2809\u20132816 (2013)","DOI":"10.1109\/CEC.2013.6557910"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"6","key":"5_CR26","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1080\/17460441.2021.1867095","volume":"16","author":"G Lambrinidis","year":"2021","unstructured":"Lambrinidis, G., Tsantili-Kakoulidou, A.: Multi-objective optimization methods in novel drug design. Expert Opin. Drug Discov. 16(6), 647\u2013658 (2021)","journal-title":"Expert Opin. Drug Discov."},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1162\/106365602760234108","volume":"10","author":"M Laumanns","year":"2002","unstructured":"Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evolutionary multiobjective optimization. Evol. Comput. 10(3), 263\u2013282 (2002)","journal-title":"Evol. Comput."},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 1\u201335 (2015)","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"5_CR29","first-page":"8807","volume":"34","author":"K Li","year":"2022","unstructured":"Li, K., Wang, H., Wang, W., Wang, F., Cui, Z.: Improving artificial bee colony algorithm using modified nearest neighbor sequence. J. King Saud Univ. Comput. Inf. Sci. 34(10), 8807\u20138824 (2022)","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"issue":"4","key":"5_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1504\/IJCSM.2022.125917","volume":"15","author":"K Li","year":"2022","unstructured":"Li, K., Xu, M., Zeng, T., Ye, T., Zhang, L., Wang, W., Wang, H.: A new artificial bee colony algorithm based on modified search strategy. Int. J. Comput. Sci. Math. 15(4), 387\u2013395 (2022)","journal-title":"Int. J. Comput. Sci. Math."},{"issue":"10","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101069","volume":"71","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Liu, J., Teng, X.: Single-particle optimization for network embedding preserving both local and global information. Swarm Evol. Comput. 71, 101069 (2022)","journal-title":"Swarm Evol. Comput."},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2022.11.047","volume":"620","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Liu, J., Wu, K.: Cost-effective competition on social networks: a multi-objective optimization perspective. Inf. Sci. 620, 31\u201346 (2023)","journal-title":"Inf. Sci."},{"key":"5_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105358","volume":"133","author":"C Ntakolia","year":"2021","unstructured":"Ntakolia, C., Iakovidis, D.K.: A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning. Comput. Oper. Res. 133, 105358 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"5_CR35","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1177\/1475921719825601","volume":"18","author":"W Ostachowicz","year":"2019","unstructured":"Ostachowicz, W., Soman, R., Malinowski, P.: Optimization of sensor placement for structural health monitoring: a review. Struct. Health Monit. 18(3), 963\u2013988 (2019)","journal-title":"Struct. Health Monit."},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","volume":"111","author":"SH Owen","year":"1998","unstructured":"Owen, S.H., Daskin, M.S.: Strategic facility location: a review. Eur. J. Oper. Res. 111(3), 423\u2013447 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/TEVC.2018.2802784","volume":"23","author":"L Pan","year":"2018","unstructured":"Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., Jin, Y.: A classification-based surrogate-assisted evolutionary algorithm for expensive many-objective optimization. IEEE Trans. Evol. Comput. 23(1), 74\u201388 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"5_CR38","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"VT Paschos","year":"1997","unstructured":"Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Comput. Surv. 29(2), 171\u2013209 (1997)","journal-title":"ACM Comput. Surv."},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Shi, L., Cai, X.: An exact fast algorithm for minimum hitting set. In: Proceedings of the International Joint Conference on Computational Science and Optimization, vol.\u00a01, pp. 64\u201367 (2010)","DOI":"10.1109\/CSO.2010.240"},{"issue":"5","key":"5_CR40","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/TEVC.2018.2883094","volume":"23","author":"HK Singh","year":"2018","unstructured":"Singh, H.K., Bhattacharjee, K.S., Ray, T.: Distance-based subset selection for benchmarking in evolutionary multi\/many-objective optimization. IEEE Trans. Evol. Comput. 23(5), 904\u2013912 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Ward, J.: Large neighborhood local search for the maximum set packing problem. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, pp. 792\u2013803 (2013)","DOI":"10.1007\/978-3-642-39206-1_67"},{"issue":"3","key":"5_CR42","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"5_CR43","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TEVC.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang, S., Li, M., Liu, X., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721\u2013736 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR44","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan, Y., Xu, H., Wang, B., Yao, X.: A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 20(1), 16\u201337 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"5_CR45","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR46","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang, Q., Zhou, A., Jin, Y.: RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans. Evol. Comput. 12(1), 41\u201363 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"5_CR47","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1109\/TEVC.2022.3179256","volume":"27","author":"T Zhang","year":"2022","unstructured":"Zhang, T., Wang, H., Yuan, B., Jin, Y., Yao, X.: Surrogate-assisted evolutionary Q-learning for black-box dynamic time-linkage optimization problems. IEEE Trans. Evol. Comput. 27(5), 1162\u20131176 (2022)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"5_CR48","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1(1), 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-70085-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:41Z","timestamp":1725664421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-70085-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031700842","9783031700859"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-70085-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","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":"Hagenberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2024","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":"ppsn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2024.fh-ooe.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}