{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:03:25Z","timestamp":1743131005996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925062"},{"type":"electronic","value":"9783030925079"}],"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-92507-9_2","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T07:09:49Z","timestamp":1639465789000},"page":"14-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recent Advances in\u00a0Scheduling Theory and\u00a0Applications in\u00a0Robotics and\u00a0Communications"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Levner","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Vishnevsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1, 61\u201368 (1954)","journal-title":"Naval Res. Logist. Q."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/0104010","volume":"4","author":"R Bellman","year":"1956","unstructured":"Bellman, R.: Mathematical aspects of scheduling theory. J. Soc. Ind. Appl. Math. 4, 168\u2013205 (1956)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1\u20132","key":"2_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Q. 3(1\u20132), 59\u201366 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1192-8","volume-title":"Scheduling Theory","author":"VS Tanaev","year":"1994","unstructured":"Tanaev, V.S., Gordon, V.S., Shafransky, Y.M.: Scheduling Theory. Single-Stage Systems. Kluwer, Dordrecht (1994)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"CY Lee","year":"1997","unstructured":"Lee, C.Y., Lei, L., Pinedo, M.: Current trends in deterministic scheduling. Ann. Oper. Res. 70, 1\u201341 (1997). https:\/\/doi.org\/10.1023\/A:1018909801944","journal-title":"Ann. Oper. Res."},{"key":"2_CR6","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 21\u2013169. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"2_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory. Algorithms and Systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M.: Scheduling: Theory. Algorithms and Systems. Prentice Hall, Englewood Cliffs (2016)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32220-7","volume-title":"Handbook on Scheduling","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Handbook on Scheduling. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-32220-7"},{"volume-title":"Multiprocessor Scheduling Theory and Applications","year":"2007","key":"2_CR9","unstructured":"Levner, E. (ed.): Multiprocessor Scheduling Theory and Applications. I-TECH Education and Publishing, Vienna (2007)"},{"volume-title":"Elements of Scheduling","year":"2020","key":"2_CR10","unstructured":"Lenstra, J.K., Shmoys, D.B. (eds.): Elements of Scheduling. Centrum Wiskunde & Informatica, Amsterdam (2020)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K Baker","year":"2003","unstructured":"Baker, K., Smith, J.C.: A multiple criterion model for machine scheduling. J. Sched. 6, 7\u201316 (2003). https:\/\/doi.org\/10.1023\/A:1022231419049","journal-title":"J. Sched."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52, 229\u2013242 (2004)","journal-title":"Oper. Res."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Agnetis, A., Pacciarelli, D., Pacifici, A.: Combinatorial models for multi-agent scheduling problems. Ch. 2 in [9], pp. 21\u201347 (2007)","DOI":"10.5772\/5213"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling. Models and Algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling. Models and Algorithms. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-41880-8"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"CT Cheng","year":"2008","unstructured":"Cheng, C.T., Ng, J.J.Y.: Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188, 603\u2013609 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-011-9316-9","volume":"49","author":"J Cohen","year":"2011","unstructured":"Cohen, J., D\u00fcrr, C., Kim, T.N.: Non-clairvoyant scheduling games. Theory Comput. Syst. 49, 3\u201323 (2011). https:\/\/doi.org\/10.1007\/s00224-011-9316-9","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.3390\/math9020117","volume":"9","author":"V Vishnevsky","year":"2021","unstructured":"Vishnevsky, V., Semenova, O.: Polling systems and their application to telecommunication networks. Mathematics 9(2), 117 (2021). https:\/\/doi.org\/10.3390\/math9020117","journal-title":"Mathematics"},{"key":"2_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32072-0","volume-title":"The Theory of Queuing Systems with Correlated Flows","author":"AN Dudin","year":"2020","unstructured":"Dudin, A.N., Klimenok, V.I., Vishnevsky, V.M.: The Theory of Queuing Systems with Correlated Flows. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-32072-0"},{"issue":"9","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.3390\/math8091501","volume":"8","author":"V Klimenok","year":"2020","unstructured":"Klimenok, V., Dudin, A., Vishnevsky, V.: Priority multi-server queueing system with heterogeneous customers. Mathematics 8(9), 1501 (2020). https:\/\/doi.org\/10.3390\/math8091501","journal-title":"Mathematics"},{"issue":"2014","key":"2_CR20","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1613\/jair.4278","volume":"50","author":"D Terekhov","year":"2014","unstructured":"Terekhov, D., Tran, T.T., Down, D.G., Beck, J.C.: Integrating Queueing theory and scheduling for dynamic scheduling problems. J. Artif. Intell. Res. 50(2014), 535\u2013572 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR21","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.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR22","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem (PDF), Report 388. Graduate School of Industrial Administration, CMU (1976)"},{"key":"2_CR23","first-page":"76","volume":"17","author":"AI Serdyukov","year":"1978","unstructured":"Serdyukov, A.I.: On some extremal walks in graphs. Upravlyaemye Sistemy 17, 76\u201379 (1978). (in Russian)","journal-title":"Upravlyaemye Sistemy"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Slugina, V.A.: A historical note on the 3\/2-approximation algorithm for the metric traveling salesman problem (2020). arXiv:2004.02437v2 [cs.DS]","DOI":"10.1016\/j.hm.2020.04.003"},{"issue":"8","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.jcss.2015.06.003","volume":"81","author":"M Karpinski","year":"2015","unstructured":"Karpinski, M., Lampis, M., Schmied, R.: New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81(8), 1665\u20131677 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP (2020). arXiv:2007.01409","DOI":"10.1145\/3406325.3451009"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1007\/BF01584070","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138\u20131162 (1970). https:\/\/doi.org\/10.1007\/BF01584070","journal-title":"Oper. Res."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S Sahni","year":"1975","unstructured":"Sahni, S.: Approximate algorithms for the 0\/1 knapsack problem. J. ACM 22, 115\u2013124 (1975)","journal-title":"J. ACM"},{"key":"2_CR29","first-page":"761","volume":"222","author":"LG Babat","year":"1975","unstructured":"Babat, L.G.: Linear functions on the N-dimensional unit cube. Dokl. Akad. Nauk SSSR 222, 761\u2013762 (1975). (in Russian)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"GV Gens","year":"1981","unstructured":"Gens, G.V., Levner, E.V.: Fast approximation algorithms for job sequencing with deadlines. Discrete Appl. Math. 3, 313\u2013318 (1981)","journal-title":"Discrete Appl. Math."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0167-6377(82)90022-0","volume":"1","author":"EL Lawler","year":"1982","unstructured":"Lawler, E.L.: A fully polynomial approximation scheme for the total tardiness problem. Oper. Res. Lett. 1, 207\u2013208 (1982)","journal-title":"Oper. Res. Lett."},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/moor.19.1.86","volume":"19","author":"MY Kovalyov","year":"1994","unstructured":"Kovalyov, M.Y., Potts, C.N., Van Wassenhove, L.N.: A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Math. Oper. Res. 19, 86\u201393 (1994)","journal-title":"Math. Oper. Res."},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1009626427432","volume":"3","author":"MY Kovalyov","year":"1998","unstructured":"Kovalyov, M.Y., Kubiak, W.: A fully polynomial time approximation scheme for minimizing Makespan of deteriorating jobs. J. Heuristics 3, 287\u2013297 (1998). https:\/\/doi.org\/10.1023\/A:1009626427432","journal-title":"J. Heuristics"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS J. Comput. 12, 57\u201375 (2000)","journal-title":"INFORMS J. Comput."},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","volume":"26","author":"CPM van Hoesel","year":"2001","unstructured":"van Hoesel, C.P.M., Wagelmans, A.P.M.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26, 339\u2013357 (2001)","journal-title":"Math. Oper. Res."},{"key":"2_CR36","first-page":"05","volume":"33","author":"SC Liu","year":"2016","unstructured":"Liu, S.C., Wu, C.C.: A faster FPTAS for a supply chain scheduling problem to minimize holding costs with outsourcing. Asia-Pac. J. Oper. Res. 33, 05 (2016)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"3","key":"2_CR37","first-page":"811","volume":"12","author":"I Kacem","year":"2016","unstructured":"Kacem, I., Levner, E.: An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs. J. Ind. Manage. Optim. 12(3), 811\u2013817 (2016)","journal-title":"J. Ind. Manage. Optim."},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/nav.21684","volume":"63","author":"YQ Yin","year":"2016","unstructured":"Yin, Y.Q., Xu, J.Y., Cheng, T.C.E., Wu, C.C., Wang, D.-J.: Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work. Naval Res. Logist. 63(2), 172\u2013183 (2016)","journal-title":"Naval Res. Logist."},{"issue":"11","key":"2_CR39","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1080\/0305215X.2018.1558446","volume":"51","author":"CL Zhao","year":"2019","unstructured":"Zhao, C.L., Hsu, C.-J.: Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs. Eng. Optim. 51(11), 1938\u20131943 (2019)","journal-title":"Eng. Optim."},{"issue":"4","key":"2_CR40","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/130925153","volume":"28","author":"N Halman","year":"2014","unstructured":"Halman, N., Klabjan, D., Li, C.-L., Orlin, J., Simchi-Levi, D.: Fully polynomial time approximation schemes for stochastic dynamic programs. SIAM J. Discrete Math. 28(4), 1725\u20131796 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR41","unstructured":"Schuurman, P., Woeginger, G.J.: Approximation schemes, a tutorial. Unpublished book (2002). http:\/\/www.math.nsc.ru\/LBRT\/k5\/DEP\/P.Schuurman,%20G.Woeginger.pdf"},{"issue":"4","key":"2_CR42","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1134\/S2070048220040201","volume":"12","author":"VM Vishnevsky","year":"2020","unstructured":"Vishnevsky, V.M., Mikhailov, E.A., Tumchenok, D.A., Shirvanyan, A.M.: Mathematical model of the operation of a tethered unmanned platform under wind loading. Math. Models Comput. Simul. 12(4), 492\u2013502 (2020). https:\/\/doi.org\/10.1134\/S2070048220040201","journal-title":"Math. Models Comput. Simul."},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-030-26118-4_23","volume-title":"Interactive Collaborative Robotics","author":"V Vishnevsky","year":"2019","unstructured":"Vishnevsky, V., Meshcheryakov, R.: Experience of developing a multifunctional tethered high-altitude unmanned platform of long-term operation. In: Ronzhin, A., Rigoll, G., Meshcheryakov, R. (eds.) ICR 2019. LNCS (LNAI), vol. 11659, pp. 236\u2013244. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26118-4_23"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-030-66471-8_3","volume-title":"Distributed Computer and Communication Networks","author":"TD Dinh","year":"2020","unstructured":"Dinh, T.D., Vishnevsky, V., Larionov, A., Vybornova, A., Kirichek, R.: Structures and deployments of a flying network using tethered multicopters for emergencies. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2020. LNCS, vol. 12563, pp. 28\u201338. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-66471-8_3"},{"issue":"3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11831-020-09418-0","volume":"28","author":"H Nawaz","year":"2020","unstructured":"Nawaz, H., Ali, H.M., Laghari, A.A.: UAV communication networks issues: a review. Arch. Comput. Methods Eng. 28(3), 1349\u20131369 (2020). https:\/\/doi.org\/10.1007\/s11831-020-09418-0","journal-title":"Arch. Comput. Methods Eng."},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Khan, M.A., Qureshi, I.M., Safi, A., Khan, I.U.: Flying ad-hoc networks (FANETs): a review of communication architectures, and routing protocols. In: 1st International Conference on Latest Trends in Electrical Engineering and Computing Technologies (2017). https:\/\/www.researchgate.net\/publication\/311707613","DOI":"10.1109\/INTELLECT.2017.8277614"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1018980928352","volume":"69","author":"V Kats","year":"1997","unstructured":"Kats, V., Levner, E.: Minimizing the number of robots to meet a given cyclic schedule. Ann. Oper. Res. 69, 209\u2013226 (1997). https:\/\/doi.org\/10.1023\/A:1018980928352","journal-title":"Ann. Oper. Res."},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0377-2217(97)00339-1","volume":"107","author":"V Kats","year":"1998","unstructured":"Kats, V., Levner, E.: Minimizing the number of vehicles in periodic scheduling: the non-Eucledean case. Eur. J. Oper. Res. 107, 371\u2013377 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Kendall, D.G.: Some problems in the theory of queues. J. Roy. Statist. Soc. Ser. B 13, 151\u2013185 (1951)","DOI":"10.1111\/j.2517-6161.1951.tb00080.x"}],"container-title":["Lecture Notes in Computer Science","Distributed Computer and Communication Networks: Control, Computation, Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92507-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T07:10:20Z","timestamp":1639465820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92507-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925062","9783030925079"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92507-9_2","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":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computer and Communication Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dccn2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.dccn.ru\/","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":"uconfy.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"151","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":"26","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":"2","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":"17% - 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":"5","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)"}}]}}