{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:45:47Z","timestamp":1743029147264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031107245"},{"type":"electronic","value":"9783031107252"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-10725-2_1","type":"book-chapter","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:29:33Z","timestamp":1659104973000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approaching Set Cover Leasing, Connected Dominating Set and\u00a0Related Problems with\u00a0Online Deterministic Algorithms"],"prefix":"10.1007","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[]},{"given":"Abdul-Nasser","family":"Kassar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"1_CR1","unstructured":"Facebook business; choose your audience. https:\/\/www.facebook.com\/business. Accessed 27 May 2018"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., Pietrzyk, P.: Towards the price of leasing online. J. Comb. Optim. 32(4), 1197\u20131216 (2016). https:\/\/doi.org\/10.1007\/s10878-015-9915-5","DOI":"10.1007\/s10878-015-9915-5"},{"issue":"12","key":"1_CR3","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.ipl.2016.07.002","volume":"116","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Heggernes, P.: Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116(12), 739\u2013743 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2016.07.002","journal-title":"Inf. Process. Lett."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Lamaa, K.: Efficient heuristic algorithms for positive-influence dominating set in social networks. In: IEEE Conference on Computer Communications Workshops, INFOCOM Workshops 2018, IEEE INFOCOM 2018, Honolulu, HI, USA, 15\u201319 April 2018, pp. 610\u2013615 (2018). https:\/\/doi.org\/10.1109\/INFCOMW.2018.8406851","DOI":"10.1109\/INFCOMW.2018.8406851"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-319-48749-6_35","volume-title":"Combinatorial Optimization and Applications","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Li, S., Markarian, C., Meyer auf der Heide, F., Podlipyan, P.: On the parameterized parallel complexity and the vertex cover problem. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 477\u2013488. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_35"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Li, S., Markarian, C., Meyer auf der Heide, F., Podlipyan, P.: Efficient parallel algorithms for parameterized problems. Theor. Comput. Sci. 786, 2\u201312 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.11.006","DOI":"10.1016\/j.tcs.2018.11.006"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Markarian, C., Meyer auf der Heide, F., Schubert, M.: Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks. Theory Comput. Syst. 62(8), 1673\u20131689 (2018). https:\/\/doi.org\/10.1007\/s00224-017-9836-z","DOI":"10.1007\/s00224-017-9836-z"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Alon, N., Awerbuch, B., Azar, Y.: The online set cover problem. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 100\u2013105. ACM, New York (2003). https:\/\/doi.org\/10.1145\/780542.780558","DOI":"10.1145\/780542.780558"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153\u2013177 (2006). https:\/\/doi.org\/10.1145\/1150334.1150336","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-72792-7_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"BM Anthony","year":"2007","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 424\u2013438. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_32"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Arafeh, M., Ceravolo, P., Mourad, A., Damiani, E.: Sampling online social networks with tailored mining strategies. In: 2019 Sixth International Conference on Social Networks Analysis, Management and Security (SNAMS), pp. 217\u2013222. IEEE (2019)","DOI":"10.1109\/SNAMS.2019.8931829"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Bai, X., Zhao, D., Bai, S., Wang, Q., Li, W., Mu, D.: Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks. Ad Hoc Networks 97, 102023 (2020). https:\/\/doi.org\/10.1016\/j.adhoc.2019.102023. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570870518304074","DOI":"10.1016\/j.adhoc.2019.102023"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Barman, S., Pal, M., Mondal, S.: An optimal algorithm to find minimum k-hop dominating set of interval graphs. Discret. Math. Algorithms Appl. 11 (2018). https:\/\/doi.org\/10.1142\/S1793830919500162","DOI":"10.1142\/S1793830919500162"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Berger, B., Rompel, J., Shor, P.W.: Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci. 49(3), 454\u2013477 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80068-6. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000005800686. 30th IEEE Conference on Foundations of Computer Science","DOI":"10.1016\/S0022-0000(05)80068-6"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Berman, P., Coulston, C.: On-line algorithms for Steiner tree problems (extended abstract), pp. 344\u2013353 (1997). https:\/\/doi.org\/10.1145\/258533.258618","DOI":"10.1145\/258533.258618"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-62127-2_15","volume-title":"Algorithms and Data Structures","author":"M Bienkowski","year":"2017","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: A deterministic algorithm for online Steiner tree leasing. In: WADS 2017. LNCS, vol. 10389, pp. 169\u2013180. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_15"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbc\u00edk, M., Larsen, K.S.: Online dominating set. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, Reykjavik, Iceland, 22\u201324 June 2016, pp. 21:1\u201321:15 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2016.21","DOI":"10.4230\/LIPIcs.SWAT.2016.21"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11561071_61","volume-title":"Algorithms \u2013 ESA 2005","author":"N Buchbinder","year":"2005","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing problems. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 689\u2013701. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_61"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). http:\/\/www.jstor.org\/stable\/3689577","DOI":"10.1287\/moor.4.3.233"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1007\/s10878-017-0128-y","volume":"34","author":"RS Coelho","year":"2017","unstructured":"Coelho, R.S., Moura, P.F.S., Wakabayashi, Y.: The k-hop connected dominating set problem: approximation and hardness. J. Comb. Optim. 34(4), 1060\u20131083 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0128-y","journal-title":"J. Comb. Optim."},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s10489-017-0987-z","volume":"48","author":"MM Daliri Khomami","year":"2018","unstructured":"Daliri Khomami, M.M., Rezvanian, A., Bagherpour, N., Meybodi, M.R.: Minimum positive influence dominating set and its application in influence maximization: a learning automata approach. Appl. Intell. 48(3), 570\u2013593 (2018). https:\/\/doi.org\/10.1007\/s10489-017-0987-z","journal-title":"Appl. Intell."},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5242-3","volume-title":"Connected Dominating Set: Theory and Applications","author":"DZ Du","year":"2013","unstructured":"Du, D.Z., Wan, P.J.: Connected Dominating Set: Theory and Applications. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5242-3"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059. http:\/\/doi.acm.org\/10.1145\/285055.285059","DOI":"10.1145\/285055.285059"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-71147-8_2","volume-title":"Combinatorial Optimization and Applications","author":"B Feldkord","year":"2017","unstructured":"Feldkord, B., Markarian, C., Meyer Auf der Heide, F.: Price fluctuation in online leasing. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 17\u201331. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_2"},{"key":"1_CR26","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-56939-1_62","volume-title":"Automata, Languages and Programming","author":"N Garg","year":"1993","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 64\u201375. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56939-1_62"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998). https:\/\/doi.org\/10.1007\/PL00009201","journal-title":"Algorithmica"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-61310-2_10","volume-title":"Integer Programming and Combinatorial Optimization","author":"MM Halld\u00f3rsson","year":"1996","unstructured":"Halld\u00f3rsson, M.M.: Approximating k-set cover and complementary graph coloring. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 118\u2013131. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_10"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Hamann, H., Markarian, C., Meyer auf der Heide, F., Wahby, M.: Pick, pack, & survive: charging robots in a modern warehouse based on online connected dominating sets. In: 9th International Conference on Fun with Algorithms, FUN 2018, La Maddalena, Italy, 13\u201315 June 2018, pp. 22:1\u201322:13 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2018.22","DOI":"10.4230\/LIPIcs.FUN.2018.22"},{"key":"1_CR31","unstructured":"Hegeman, J., Ge, H., Gubin, M., Amit, A.: Sponsored advertisement ranking and pricing in a social networking system. US Patent 10,565,598, 18 February 2020"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Hu, X., Ludwig, A., Richa, A.W., Schmid, S.: Competitive strategies for online cloud resource allocation with discounts: the 2-dimensional parking permit problem. In: 35th IEEE International Conference on Distributed Computing Systems, ICDCS 2015, Columbus, OH, USA, 29 June\u20132 July 2015, pp. 93\u2013102 (2015). https:\/\/doi.org\/10.1109\/ICDCS.2015.18","DOI":"10.1109\/ICDCS.2015.18"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Huang, L., Li, J., Shi, Q.: Approximation algorithms for the connected sensor cover problem. Theor. Comput. Sci. 809, 563\u2013574 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.01.020. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397520300487","DOI":"10.1016\/j.tcs.2020.01.020"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974). https:\/\/doi.org\/10.1016\/S0022-0000(74)80044-9. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000074800449","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-31104-8_6","volume-title":"Structural Information and Communication Complexity","author":"P Kling","year":"2012","unstructured":"Kling, P., Meyer auf der Heide, F., Pietrzyk, P.: An algorithm for online facility leasing. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 61\u201372. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_6"},{"key":"1_CR36","unstructured":"Korman, S.: On the use of randomization in the online set cover problem. Master\u2019s thesis, Weizmann Institute of Science, Israel (2005)"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Li, S., Markarian, C., Meyer auf der Heide, F.: Towards flexible demands in online leasing problems. Algorithmica 80(5), 1556\u20131574 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0420-y","DOI":"10.1007\/s00453-018-0420-y"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"de Lima, M.S., Felice, M.C.S., Lee, O.: On generalizations of the parking permit problem and network leasing problems. Electron. Notes Discret. Math. 62, 225\u2013230 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.10.039","DOI":"10.1016\/j.endm.2017.10.039"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975). https:\/\/doi.org\/10.1016\/0012-365X(75)90058-8. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X75900588","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994). https:\/\/doi.org\/10.1145\/185675.306789. http:\/\/doi.acm.org\/10.1145\/185675.306789","DOI":"10.1145\/185675.306789"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Markarian, C., Kassar, A.N.: Online deterministic algorithms for connected dominating set and set cover leasing problems. In: Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, ICORES 2020, Valetta, Malta, 21\u201324 February 2020, pp. 121\u2013128 (2020)","DOI":"10.5220\/0008866701210128"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Markarian, C., Meyer auf der Heide, F.: Online algorithms for leasing vertex cover and leasing non-metric facility location. In: Parlier, G.H., Liberatore, F., Demange, M. (eds.) Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, Prague, Czech Republic, 19\u201321 February 2019, pp. 315\u2013321. SciTePress (2019). https:\/\/doi.org\/10.5220\/0007369503150321","DOI":"10.5220\/0007369503150321"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Meyerson, A.: The parking permit problem. In: Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), Pittsburgh, PA, USA, 23\u201325 October 2005, pp. 274\u2013284 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.72","DOI":"10.1109\/SFCS.2005.72"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-30570-5_6","volume-title":"Database Theory - ICDT 2005","author":"K Munagala","year":"2004","unstructured":"Munagala, K., Babu, S., Motwani, R., Widom, J.: The pipelined set cover problem. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 83\u201398. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30570-5_6"},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.disopt.2013.10.001","volume":"10","author":"C Nagarajan","year":"2013","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Discret. Optim. 10(4), 361\u2013370 (2013). https:\/\/doi.org\/10.1016\/j.disopt.2013.10.001","journal-title":"Discret. Optim."},{"issue":"2","key":"1_CR46","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.comcom.2012.10.005","volume":"36","author":"J Yu","year":"2013","unstructured":"Yu, J., Wang, N., Wang, G., Yu, D.: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey. Comput. Commun. 36(2), 121\u2013134 (2013). https:\/\/doi.org\/10.1016\/j.comcom.2012.10.005","journal-title":"Comput. Commun."}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10725-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:32:10Z","timestamp":1659105130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10725-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107245","9783031107252"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10725-2_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valetta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","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":"22 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icores.scitevents.org\/?y=2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","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":"17","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":"18","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":"25% - 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":"4","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)"}},{"value":"5 selected papers included in this CCIS proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}