{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:03:52Z","timestamp":1747469032023,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T00:00:00Z","timestamp":1693872000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T00:00:00Z","timestamp":1693872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001782","name":"University of Melbourne","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001782","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,12]]},"abstract":"Abstract<\/jats:title>Let $$P=\\{p_0,\\ldots ,p_{n-1}\\}$$<\/jats:tex-math>\n \n P<\/mml:mi>\n =<\/mml:mo>\n {<\/mml:mo>\n \n p<\/mml:mi>\n 0<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n \u2026<\/mml:mo>\n ,<\/mml:mo>\n \n p<\/mml:mi>\n \n n<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msub>\n }<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> be a set of points in $${\\mathbb R}^d$$<\/jats:tex-math>\n \n \n R<\/mml:mi>\n <\/mml:mrow>\n d<\/mml:mi>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, modeling devices in a wireless network. A range assignment assigns a range $$r(p_i)$$<\/jats:tex-math>\n \n r<\/mml:mi>\n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to each point $$p_i\\in P$$<\/jats:tex-math>\n \n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n \u2208<\/mml:mo>\n P<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, thus inducing a directed communication graph $$\\mathcal {G}_r$$<\/jats:tex-math>\n \n G<\/mml:mi>\n r<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in which there is a directed edge $$(p_i,p_j)$$<\/jats:tex-math>\n \n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> iff $${{\\,\\textrm{dist}\\,}}(p_i, p_j) \\leqslant r(p_i)$$<\/jats:tex-math>\n \n \n \n dist<\/mml:mtext>\n \n <\/mml:mrow>\n \n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n \u2a7d<\/mml:mo>\n r<\/mml:mi>\n \n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where $${{\\,\\textrm{dist}\\,}}(p_i,p_j)$$<\/jats:tex-math>\n \n \n \n dist<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> denotes the distance between\u00a0$$p_i$$<\/jats:tex-math>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and\u00a0$$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. The range-assignment problem is to assign the transmission ranges such that $$\\mathcal {G}_r$$<\/jats:tex-math>\n \n G<\/mml:mi>\n r<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> has a certain desirable property, while minimizing the cost of the assignment; here the cost is given by $$\\sum _{p_i\\in P} r(p_i)^{\\alpha }$$<\/jats:tex-math>\n \n \n \u2211<\/mml:mo>\n \n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n \u2208<\/mml:mo>\n P<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n r<\/mml:mi>\n \n \n (<\/mml:mo>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n \u03b1<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for some constant\u00a0$$\\alpha >1$$<\/jats:tex-math>\n \n \u03b1<\/mml:mi>\n ><\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> called the distance-power gradient. We introduce the online version of the range-assignment problem, where the points $$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> arrive one by one, and the range assignment has to be updated at each arrival. Following the standard in online algorithms, resources given out cannot be taken away\u2014in our case this means that the transmission ranges will never decrease. The property we want to maintain is that $$\\mathcal {G}_r$$<\/jats:tex-math>\n \n G<\/mml:mi>\n r<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> has a broadcast tree rooted at the first point\u00a0$$p_0$$<\/jats:tex-math>\n \n p<\/mml:mi>\n 0<\/mml:mn>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Our results include the following.\n \n We prove that already in $${\\mathbb R}^1$$<\/jats:tex-math>\n \n \n R<\/mml:mi>\n <\/mml:mrow>\n 1<\/mml:mn>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, a 1-competitive algorithm does not exist. In particular, for distance-power gradient\u00a0$$\\alpha =2$$<\/jats:tex-math>\n \n \u03b1<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> any online algorithm has competitive ratio at least\u00a01.57.<\/jats:p>\n <\/jats:list-item>\n \n For points in $${\\mathbb R}^1$$<\/jats:tex-math>\n \n \n R<\/mml:mi>\n <\/mml:mrow>\n 1<\/mml:mn>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $${\\mathbb R}^2$$<\/jats:tex-math>\n \n \n R<\/mml:mi>\n <\/mml:mrow>\n 2<\/mml:mn>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we analyze two natural strategies for updating the range assignment upon the arrival of a new point $$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. The strategies do not change the assignment if $$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is already within range of an existing point, otherwise they increase the range of a single point, as follows: Nearest-Neighbor<\/jats:sc> (nn<\/jats:sc>) increases the range of $${{\\,\\textrm{nn}\\,}}(p_j)$$<\/jats:tex-math>\n \n \n \n nn<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the nearest neighbor of\u00a0$$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, to $${{\\,\\textrm{dist}\\,}}(p_j, {{\\,\\textrm{nn}\\,}}(p_j))$$<\/jats:tex-math>\n \n \n \n dist<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n \n nn<\/mml:mtext>\n \n <\/mml:mrow>\n \n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and Cheapest Increase<\/jats:sc> (ci<\/jats:sc>) increases the range of the point $$p_i$$<\/jats:tex-math>\n \n p<\/mml:mi>\n i<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for which the resulting cost increase to be able to reach the new point\u00a0$$p_j$$<\/jats:tex-math>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is minimal. We give lower and upper bounds on the competitive ratio of these strategies as a function of the distance-power gradient\u00a0$$\\alpha $$<\/jats:tex-math>\n \u03b1<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We also analyze the following variant of nn<\/jats:sc> in $${\\mathbb R}^2$$<\/jats:tex-math>\n \n \n R<\/mml:mi>\n <\/mml:mrow>\n 2<\/mml:mn>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for $$\\alpha =2$$<\/jats:tex-math>\n \n \u03b1<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>: 2-Nearest-Neighbor<\/jats:sc> (2-nn<\/jats:sc>) increases the range of $${{\\,\\textrm{nn}\\,}}(p_j)$$<\/jats:tex-math>\n \n \n \n nn<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> to $$2\\cdot {{\\,\\textrm{dist}\\,}}(p_j,{{\\,\\textrm{nn}\\,}}(p_j))$$<\/jats:tex-math>\n \n 2<\/mml:mn>\n \u00b7<\/mml:mo>\n \n \n dist<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n \n nn<\/mml:mtext>\n \n <\/mml:mrow>\n \n (<\/mml:mo>\n \n p<\/mml:mi>\n j<\/mml:mi>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>,<\/jats:p>\n <\/jats:list-item>\n \n We generalize the problem to points in arbitrary metric spaces, where we present an $$O(\\log n)$$<\/jats:tex-math>\n \n O<\/mml:mi>\n (<\/mml:mo>\n log<\/mml:mo>\n n<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-competitive algorithm.<\/jats:p>\n <\/jats:list-item>\n <\/jats:list><\/jats:p>","DOI":"10.1007\/s00453-023-01166-4","type":"journal-article","created":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T05:01:26Z","timestamp":1693890086000},"page":"3928-3956","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Online Broadcast Range-Assignment Problem"],"prefix":"10.1007","volume":"85","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Markovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6984-4007","authenticated-orcid":false,"given":"Seeun William","family":"Umboh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,5]]},"reference":[{"issue":"2","key":"1166_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/060661946","volume":"39","author":"N Alon","year":"2009","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39(2), 361\u2013370 (2009). https:\/\/doi.org\/10.1137\/060661946","journal-title":"SIAM J. Comput."},{"key":"1166_CR2","doi-asserted-by":"publisher","unstructured":"Christoph, A., Andrea, E.F. Clementi, M.D.I., Nissan L.-T., Angelo, Ml, David, P., Gianluca, R., Riccardo, S.: Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks. In Proceedings of 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS 2004), Vol. 2996 of Lecture Notes in Computer Science, pp. 418\u2013427. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_37.","DOI":"10.1007\/978-3-540-24749-4_37."},{"issue":"5","key":"1166_CR3","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1007\/s00453-018-0519-1","volume":"81","author":"J Boyar","year":"2019","unstructured":"Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrbc\u00edk, M., Larsen, K.S.: Online dominating set. Algorithmica 81(5), 1938\u20131964 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0519-1","journal-title":"Algorithmica"},{"issue":"3","key":"1166_CR4","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/100819540","volume":"27","author":"G C\u0103linescu","year":"2013","unstructured":"C\u0103linescu, G.: Approximate min-power strong connectivity. SIAM J. Discret. Math. 27(3), 1527\u20131543 (2013). https:\/\/doi.org\/10.1137\/100819540","journal-title":"SIAM J. Discret. Math."},{"key":"1166_CR5","doi-asserted-by":"publisher","unstructured":"Andrea, E.F., Clementi, P.C., Paolo, P., Gianluca, R., Paola, V.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Proceedings of 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), Vol. 2010 of Lecture Notes in Computer Science, pp. 121\u2013131. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_11.","DOI":"10.1007\/3-540-44693-1_11."},{"key":"1166_CR6","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some ecent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proceedings of 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE 2002) (2002)"},{"issue":"1\u20133","key":"1166_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"299","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Ianni, M.D., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299(1\u20133), 751\u2013761 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00538-8","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1166_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-002-0985-2","volume":"35","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Penna, P., Ferreira, A., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica 35(2), 95\u2013110 (2003). https:\/\/doi.org\/10.1007\/s00453-002-0985-2","journal-title":"Algorithmica"},{"key":"1166_CR9","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignmet problem in packet radio networks. In: Proceedings of 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd\u00a0International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX\u201999)"},{"issue":"2","key":"1166_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"AEF Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mob. Netw. Appl. 9(2), 125\u2013140 (2004). https:\/\/doi.org\/10.1023\/B:MONE.0000013624.32948.87","journal-title":"Mob. Netw. Appl."},{"issue":"4","key":"1166_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/net.20227","volume":"52","author":"B Fuchs","year":"2008","unstructured":"Fuchs, B.: On the hardness of range assignment problems. Networks 52(4), 183\u2013195 (2008). https:\/\/doi.org\/10.1002\/net.20227","journal-title":"Networks"},{"key":"1166_CR12","doi-asserted-by":"publisher","unstructured":"Grandoni, F.: On min-power steiner tree. In: Proceedings of 20th Annual European Symposium on Algorithms (ESA 2012), volume 7501 of Lecture Notes in Computer Science, pp. 527\u2013538. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_46","DOI":"10.1007\/978-3-642-33090-2_46"},{"issue":"1","key":"1166_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Inf. Comput. 150(1), 57\u201374 (1999). https:\/\/doi.org\/10.1006\/inco.1998.2754","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"1166_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"LM Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1\u20132), 289\u2013305 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00223-0","journal-title":"Theor. Comput. Sci."},{"key":"1166_CR15","unstructured":"Pahlavan, K., Levesque, A.H.: Wireless information networks, 2nd edn. Wiley series in telecommunications and signal processing. Wiley-VCH (2005)"},{"issue":"2","key":"1166_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"Daniel Dominic Sleator and Robert Endre Tarjan","year":"1985","unstructured":"Daniel Dominic Sleator and Robert Endre Tarjan: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). https:\/\/doi.org\/10.1145\/2786.2793","journal-title":"Commun. ACM"},{"issue":"6","key":"1166_CR17","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P-J Wan","year":"2002","unstructured":"Wan, P.-J., C\u0103linescu, G., Li, X.-Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Networks 8(6), 607\u2013617 (2002). https:\/\/doi.org\/10.1023\/A:1020381720601","journal-title":"Wirel. Networks"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01166-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01166-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01166-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:06:18Z","timestamp":1699621578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01166-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,5]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1166"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01166-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2023,9,5]]},"assertion":[{"value":"5 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}