[{"type":"journal_article","status":"public","user_id":"38705","department":[{"_id":"63"}],"project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"_id":"33947","article_type":"original","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"citation":{"apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>, 261–291. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291.","mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">10.1016/j.tcs.2022.10.031</a>.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i> 939 (2023): 261–91. <a href=\"https://doi.org/10.1016/j.tcs.2022.10.031\">https://doi.org/10.1016/j.tcs.2022.10.031</a>."},"page":"261-291","intvolume":"       939","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Jonas","id":"47213","full_name":"Harbig, Jonas","last_name":"Harbig"},{"first_name":"Daniel","full_name":"Jung, Daniel","id":"37827","last_name":"Jung"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"volume":939,"date_updated":"2023-01-30T09:20:09Z","doi":"10.1016/j.tcs.2022.10.031","publication":"Theoretical Computer Science","external_id":{"arxiv":["2010.04424 "]},"language":[{"iso":"eng"}],"keyword":["General Computer Science","Theoretical Computer Science"],"year":"2023","date_created":"2022-10-28T05:11:16Z","publisher":"Elsevier BV","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation"},{"publication":"Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ","language":[{"iso":"eng"}],"external_id":{"arxiv":["2206.07567 "]},"year":"2023","title":"A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ","date_created":"2022-11-04T09:41:30Z","publisher":"Schloss Dagstuhl – Leibniz Zentrum für Informatik","status":"public","editor":[{"last_name":"Hillel","full_name":"Hillel, Eshcar","first_name":"Eshcar"},{"first_name":"Roberto","full_name":"Palmieri, Roberto","last_name":"Palmieri"},{"first_name":"Etienne","last_name":"Riviére","full_name":"Riviére, Etienne"}],"type":"conference","department":[{"_id":"63"}],"user_id":"38705","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"34008","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"page":"15:1–15:25","intvolume":"       253","citation":{"short":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.","mla":"Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, &#38; E. Riviére (Eds.), <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i> (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>","ama":"Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>. Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>","ieee":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, Brussels, 2023, vol. 253, p. 15:1–15:25, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">10.4230/LIPIcs.OPODIS.2022.15</a>.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In <i>Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) </i>, edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2022.15\">https://doi.org/10.4230/LIPIcs.OPODIS.2022.15</a>."},"place":"Brussels","publication_identifier":{"isbn":["978-3-95977-265-5"],"issn":["1868-8969"]},"publication_status":"published","doi":"10.4230/LIPIcs.OPODIS.2022.15","conference":{"start_date":"2022-12-13","name":"26th International Conference on Principles of Distributed Systems (OPODIS)","location":"Brussels","end_date":"2022-12-15"},"volume":253,"author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Jonas","id":"47213","full_name":"Harbig, Jonas","last_name":"Harbig"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2023-02-15T14:53:12Z"},{"project":[{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"_id":"45579","user_id":"39241","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2023-06-12T21:03:14Z","date_created":"2023-06-12T13:05:04Z","author":[{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Online Algorithms for Allocating Heterogeneous Resources","doi":"10.17619/UNIPB/1-1751","year":"2023","citation":{"apa":"Knollmann, T. (2023). <i>Online Algorithms for Allocating Heterogeneous Resources</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>","short":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.","bibtex":"@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>}, author={Knollmann, Till}, year={2023} }","mla":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>.","chicago":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>.","ieee":"T. Knollmann, <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023.","ama":"Knollmann T. <i>Online Algorithms for Allocating Heterogeneous Resources</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>"}},{"file_date_updated":"2023-07-07T06:20:43Z","_id":"45875","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"}],"department":[{"_id":"7"}],"user_id":"477","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"status":"public","type":"book_chapter","doi":"10.5281/zenodo.8060372","date_updated":"2023-07-07T06:21:57Z","oa":"1","volume":412,"author":[{"first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727","last_name":"Götte"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}],"place":"Paderborn","intvolume":"       412","page":"1--20","citation":{"ama":"Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20. doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>","chicago":"Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>.","ieee":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.","apa":"Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., &#38; Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>","bibtex":"@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Capabilities and Limitations of Local Strategies in Dynamic Networks}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>.","short":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20."},"has_accepted_license":"1","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-07-07T06:20:43Z","creator":"ups","date_created":"2023-07-07T06:20:43Z","file_size":543715,"access_level":"open_access","file_name":"A1-Chapter-SFB-Buch-Final.pdf","file_id":"45876","content_type":"application/pdf","relation":"main_file"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"Capabilities and Limitations of Local Strategies in Dynamic Networks","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T06:21:38Z","year":"2023"},{"citation":{"apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>, Article 104877. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 104877, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” <i>Information and Computation</i>, Art. no. 104877, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>."},"year":"2022","publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","doi":"10.1016/j.ic.2022.104877","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","date_created":"2022-02-15T07:38:28Z","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"publisher":"Elsevier BV","date_updated":"2022-02-15T07:41:00Z","status":"public","publication":"Information and Computation","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"article_number":"104877","department":[{"_id":"63"}],"user_id":"38705","_id":"29843","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}]},{"title":"The k-Server with Preferences Problem","date_created":"2022-06-10T09:06:42Z","publisher":"Association for Computing Machinery","year":"2022","language":[{"iso":"eng"}],"keyword":["K-Server Problem","Heterogeneity","Online Caching"],"external_id":{"arxiv":["2205.11102"]},"abstract":[{"text":"The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n    \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.","lang":"eng"}],"publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","doi":"10.1145/3490148.3538595","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"},{"id":"41265","full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-08-02T08:07:30Z","citation":{"chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>.","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2022, pp. 345–356, doi: <a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2022:345-356. doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }","mla":"Castenow, Jannik, et al. “The K-Server with Preferences Problem.” <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2022, pp. 345–56, doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–356. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>"},"page":"345-356","publication_identifier":{"isbn":["9781450391467"]},"user_id":"39241","department":[{"_id":"63"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"31847","status":"public","type":"conference"},{"citation":{"apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>.","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>"},"year":"2022","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","doi":"10.1007/s00453-022-00978-0","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","date_created":"2022-05-27T10:09:24Z","author":[{"first_name":"Surender","full_name":"Baswana, Surender","last_name":"Baswana"},{"full_name":"Gupta, Shiv","last_name":"Gupta","first_name":"Shiv"},{"first_name":"Till","id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696"}],"genbank":["tillk"],"publisher":"Springer Science and Business Media LLC","date_updated":"2022-05-27T10:14:27Z","status":"public","publication":"Algorithmica","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}],"user_id":"39241","_id":"31479","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"type":"journal_article","publication":"Information and Computation","status":"public","abstract":[{"text":"While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys.","lang":"eng"}],"user_id":"15504","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"21096","language":[{"iso":"eng"}],"article_number":"104697","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"citation":{"ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>.","ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” <i>Information and Computation</i>, Art. no. 104697, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","apa":"Knollmann, T., &#38; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>, Article 104697. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 104697, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","short":"T. Knollmann, C. Scheideler, Information and Computation (2022)."},"year":"2022","date_created":"2021-01-29T09:39:40Z","author":[{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2023-03-27T07:56:48Z","doi":"10.1016/j.ic.2021.104697","title":"A self-stabilizing Hashed Patricia Trie"},{"date_created":"2021-09-03T09:01:25Z","publisher":"Springer","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time","year":"2021","external_id":{"arxiv":["2010.04424"]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","author":[{"last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik"},{"first_name":"Jonas","last_name":"Harbig","id":"47213","full_name":"Harbig, Jonas"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"volume":12961,"date_updated":"2022-01-06T06:55:58Z","doi":"10.1007/978-3-030-89240-1_3","conference":{"end_date":"2021-09-10","location":"Lissabon","name":"17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) 2021","start_date":"2021-09-09"},"publication_status":"published","citation":{"mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021, series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time}, volume={12961}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>}, booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz}, year={2021}, pages={29–44}, collection={LNCS} }","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, &#38; T. Radzik (Eds.), <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i> (Vol. 12961, pp. 29–44). Springer. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">https://doi.org/10.1007/978-3-030-89240-1_3</a>","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R, Radzik T, eds. <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Vol 12961. LNCS. Springer; 2021:29-44. doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” In <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">https://doi.org/10.1007/978-3-030-89240-1_3</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time,” in <i>Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, Lissabon, 2021, vol. 12961, pp. 29–44, doi: <a href=\"https://doi.org/10.1007/978-3-030-89240-1_3\">10.1007/978-3-030-89240-1_3</a>."},"page":"29 - 44","intvolume":"     12961","series_title":"LNCS","user_id":"38705","department":[{"_id":"63"}],"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"_id":"23730","type":"conference","status":"public","editor":[{"full_name":"Gasieniec, Leszek","last_name":"Gasieniec","first_name":"Leszek"},{"first_name":"Ralf","last_name":"Klasing","full_name":"Klasing, Ralf"},{"first_name":"Tomasz","full_name":"Radzik, Tomasz","last_name":"Radzik"}]},{"status":"public","publication":"Theory of Computing Systems","type":"journal_article","language":[{"iso":"eng"}],"_id":"20683","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"15415","year":"2021","page":"943–984","intvolume":"        65","citation":{"apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>, <i>65</i>, 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.","bibtex":"@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i>, vol. 65, 2021, pp. 943–984, doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>. 2021;65:943–984. doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” <i>Theory of Computing Systems</i>, vol. 65, pp. 943–984, 2021, doi: <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i> 65 (2021): 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>."},"publication_status":"published","title":"Managing Multiple Mobile Resources","doi":"10.1007/s00224-020-10023-8","date_updated":"2022-01-06T06:54:31Z","volume":65,"author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Till","id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"full_name":"Malatyali, Manuel","id":"41265","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-12-08T08:40:10Z"},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["2109.11856"]},"publication":"Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021","title":"The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation","publisher":"Springer","date_created":"2021-10-28T07:01:30Z","year":"2021","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"_id":"26986","series_title":"LNCS","user_id":"38705","department":[{"_id":"63"}],"editor":[{"first_name":"C.","last_name":"Johnen","full_name":"Johnen, C."},{"last_name":"Schiller","full_name":"Schiller, E.M.","first_name":"E.M."},{"first_name":"S.","last_name":"Schmid","full_name":"Schmid, S."}],"status":"public","type":"conference","conference":{"start_date":"2021-11-17","name":"23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems","location":"Online","end_date":"2021-11-20"},"doi":"10.1007/978-3-030-91081-5_19","date_updated":"2022-01-07T15:24:10Z","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"volume":13046,"citation":{"chicago":"Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” In <i>Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021</i>, edited by C. Johnen, E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">https://doi.org/10.1007/978-3-030-91081-5_19</a>.","ieee":"J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation,” in <i>Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021</i>, Online, 2021, vol. 13046, pp. 289–304, doi: <a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">10.1007/978-3-030-91081-5_19</a>.","ama":"Castenow J, Götte T, Knollmann T, Meyer auf der Heide F. The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller EM, Schmid S, eds. <i>Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021</i>. Vol 13046. LNCS. Springer; 2021:289-304. doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">10.1007/978-3-030-91081-5_19</a>","apa":"Castenow, J., Götte, T., Knollmann, T., &#38; Meyer auf der Heide, F. (2021). The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In C. Johnen, E. M. Schiller, &#38; S. Schmid (Eds.), <i>Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021</i> (Vol. 13046, pp. 289–304). Springer. <a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">https://doi.org/10.1007/978-3-030-91081-5_19</a>","mla":"Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” <i>Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021</i>, edited by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">10.1007/978-3-030-91081-5_19</a>.","bibtex":"@inproceedings{Castenow_Götte_Knollmann_Meyer auf der Heide_2021, series={LNCS}, title={The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation}, volume={13046}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-91081-5_19\">10.1007/978-3-030-91081-5_19</a>}, booktitle={Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021}, publisher={Springer}, author={Castenow, Jannik and Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Johnen, C. and Schiller, E.M. and Schmid, S.}, year={2021}, pages={289–304}, collection={LNCS} }","short":"J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304."},"page":"289-304 ","intvolume":"     13046","publication_status":"published"},{"publication_identifier":{"isbn":["978-3-030-64347-8"]},"publication_status":"published","intvolume":"     12514","page":"65-80","citation":{"apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes  &#38; N. Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i> (Vol. 12514, pp. 65–80). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes , Stéphane  and Mittal, Neeraj Editors}, year={2020}, pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>.","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, 2020, vol. 12514, pp. 65–80.","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes  S, Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>"},"date_updated":"2022-01-06T06:54:14Z","volume":12514,"author":[{"full_name":"Castenow, Jannik","id":"38705","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"doi":"10.1007/978-3-030-64348-5_6","type":"conference","editor":[{"last_name":"Devismes ","full_name":"Devismes , Stéphane ","first_name":"Stéphane "},{"first_name":"Neeraj ","full_name":"Mittal, Neeraj ","last_name":"Mittal"}],"status":"public","_id":"19899","department":[{"_id":"63"}],"user_id":"38705","series_title":"Lecture Notes in Computer Science (LNCS)","year":"2020","publisher":"Springer","date_created":"2020-10-06T07:27:10Z","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up","publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings","abstract":[{"lang":"eng","text":"Most existing robot formation problems seek a target formation of a certain\r\nminimal and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation problem. In this work, we study formation problems that\r\ntry to reach a maximal structure, supporting for example an efficient\r\ncoverage in exploration scenarios. A recent example is the NASA Shapeshifter\r\nproject, which describes how the robots form a relay chain along which gathered\r\ndata from extraterrestrial cave explorations may be sent to a home base.\r\n  As a first step towards understanding such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem, where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting chain and must form a connected,\r\nstraight line of maximal length connecting its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a continuous time model. In the\r\ndiscrete case, we give a complete analysis if all robots are initially\r\ncollinear, showing that the worst-case time to reach an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot \\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$. If one endpoint of the chain remains stationary, this result\r\ncan be extended to the non-collinear case. If both endpoints move, we identify\r\na family of instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect of the strategy: slowing down the endpoints while all\r\nother robots move at full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in the discrete model."}],"external_id":{"arxiv":["2010.02043 "]},"language":[{"iso":"eng"}]},{"keyword":["Mincut","Sensitivity","Data Structure"],"language":[{"iso":"eng"}],"publication":"28th Annual European Symposium on Algorithms (ESA 2020)","abstract":[{"lang":"eng","text":"Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. \r\n1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). \r\n2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. \r\nFor both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size."}],"publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik","date_created":"2020-10-21T12:00:20Z","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2020","_id":"20159","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"39241","department":[{"_id":"63"}],"type":"conference","editor":[{"last_name":"Grandoni","full_name":"Grandoni, Fabrizio","first_name":"Fabrizio"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"},{"last_name":"Sanders","full_name":"Sanders, Peter","first_name":"Peter"}],"status":"public","date_updated":"2022-01-06T06:54:20Z","author":[{"first_name":"Surender","last_name":"Baswana","full_name":"Baswana, Surender"},{"first_name":"Shiv","full_name":"Gupta, Shiv","last_name":"Gupta"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"}],"volume":173,"doi":"10.4230/LIPIcs.ESA.2020.12","publication_identifier":{"isbn":["978-3-95977-162-7"],"issn":["1868-8969"]},"place":"Dagstuhl, Germany","citation":{"apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, &#38; P. Sanders (Eds.), <i>28th Annual European Symposium on Algorithms (ESA 2020)</i> (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>.","bibtex":"@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>}, booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, 2020, vol. 173, pp. 12:1-12:14.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” In <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>.","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>. Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>"},"page":"12:1-12:14","intvolume":"       173"},{"intvolume":"     12514","page":"60-64","citation":{"chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility ,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, 2020, vol. 12514, pp. 60–64.","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In: Devismes S,  Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility }, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In S. Devismes &#38; N.  Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i> (Vol. 12514, pp. 60–64). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>"},"publication_identifier":{"isbn":["978-3-030-64347-8"]},"publication_status":"published","doi":"10.1007/978-3-030-64348-5_5","date_updated":"2022-01-06T06:54:21Z","volume":12514,"author":[{"first_name":"Jannik","last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik"},{"last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213","first_name":"Jonas"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"editor":[{"last_name":"Devismes","full_name":"Devismes, Stéphane ","first_name":"Stéphane "},{"last_name":" Mittal","full_name":" Mittal, Neeraj","first_name":"Neeraj"}],"status":"public","type":"conference","_id":"20185","department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science (LNCS)","user_id":"38705","year":"2020","title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","publisher":"Springer","date_created":"2020-10-23T08:50:28Z","publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.04424 "]}},{"keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2005.08391"]},"abstract":[{"text":" We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \\( S \\) of commodities.\r\n  Ravi and Sinha (SODA 2004) introduced the model as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.\r\n  The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.\r\n  In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.\r\n  A request has to be connected to a set of facilities jointly offering the commodities demanded by it.\r\n  In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.\r\n\r\n  To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.\r\n  We present results regarding the competitive ratio.\r\n  On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \\( \\Omega (  \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n}  ) \\) that already holds for simple line metrics.\r\n  Here, \\( n \\) is the number of requests.\r\n  On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n  Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1271416,"file_id":"17373","file_name":"3350755.3400281.pdf","access_level":"closed","date_updated":"2020-07-14T07:56:52Z","creator":"tillk","date_created":"2020-07-14T07:56:52Z"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","title":"The Online Multi-Commodity Facility Location Problem","date_created":"2020-07-14T07:53:20Z","year":"2020","file_date_updated":"2020-07-14T07:56:52Z","_id":"17370","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"39241","status":"public","type":"conference","doi":"10.1145/3350755.3400281","date_updated":"2022-01-06T06:53:10Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>.","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>"},"publication_identifier":{"isbn":["9781450369350"]},"has_accepted_license":"1","publication_status":"published"},{"year":"2020","title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","date_created":"2020-07-14T07:53:47Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"3350755.3400263.pdf","file_id":"17372","file_size":1078544,"date_created":"2020-07-14T07:56:04Z","creator":"janniksu","date_updated":"2020-07-14T07:56:04Z"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","language":[{"iso":"eng"}],"ddc":["000"],"external_id":{"arxiv":["2010.02043 "]},"citation":{"apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>.","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>"},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450369350"]},"doi":"10.1145/3350755.3400263","author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:53:10Z","status":"public","type":"conference","file_date_updated":"2020-07-14T07:56:04Z","user_id":"38705","department":[{"_id":"63"}],"_id":"17371"},{"citation":{"bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer, 2019, pp. 120–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>.","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2019, pp. 120–137."},"page":"120 - 137","year":"2019","publication_status":"published","doi":"10.1007/978-3-030-39479-0_9","title":"Managing Multiple Mobile Resources","author":[{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2019-07-22T09:00:05Z","date_updated":"2022-01-06T06:51:20Z","publisher":"Springer","status":"public","type":"conference","publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","language":[{"iso":"eng"}],"user_id":"22704","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"external_id":{"arxiv":["1907.09834"]},"_id":"12870"},{"year":"2018","date_created":"2018-09-17T13:12:18Z","publisher":"Springer, Cham","title":"A Self-Stabilizing Hashed Patricia Trie","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"file_size":500005,"access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","file_id":"5277","date_updated":"2018-11-02T14:38:37Z","date_created":"2018-11-02T14:38:37Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.","lang":"eng"}],"external_id":{"arxiv":["1809.04923"]},"language":[{"iso":"eng"}],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"ddc":["000"],"has_accepted_license":"1","intvolume":"     11201","citation":{"apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>"},"volume":11201,"author":[{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:01:02Z","conference":{"start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","location":"Tokyo","end_date":"2018-11-07"},"doi":"10.1007/978-3-030-03232-6_1","type":"conference","status":"public","editor":[{"first_name":"Taisuke","last_name":"Izumi","full_name":"Izumi, Taisuke"},{"last_name":"Kuznetsov","full_name":"Kuznetsov, Petr","first_name":"Petr"}],"department":[{"_id":"63"},{"_id":"79"}],"series_title":"Lecture Notes of Computer Science","user_id":"39241","_id":"4411","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"file_date_updated":"2018-11-02T14:38:37Z"},{"abstract":[{"text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"tillk","date_created":"2018-11-27T10:03:33Z","date_updated":"2018-11-27T10:03:33Z","access_level":"closed","file_id":"5863","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","file_size":1122875}],"status":"public","type":"conference","publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","ddc":["000"],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"file_date_updated":"2018-11-27T10:03:33Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4375","user_id":"14955","department":[{"_id":"63"},{"_id":"79"}],"year":"2018","citation":{"chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>"},"has_accepted_license":"1","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","doi":"10.1007/978-3-030-19759-9_4","conference":{"name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20","end_date":"2018-08-21","location":"Helsinki"},"date_updated":"2022-01-06T07:01:00Z","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"},{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2018-09-11T05:26:59Z"},{"publication":"Structural Information and Communication Complexity","type":"book_chapter","status":"public","external_id":{"arxiv":["arXiv:1706.03568 "]},"_id":"16461","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783319720494","9783319720500"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2017","place":"Cham","citation":{"ama":"Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: <i>Structural Information and Communication Complexity</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>","ieee":"P. Bemmann <i>et al.</i>, “Monitoring of Domain-Related Problems in Distributed Data Streams,” in <i>Structural Information and Communication Complexity</i>, Cham, 2017.","chicago":"Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In <i>Structural Information and Communication Complexity</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>.","apa":"Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &#38; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In <i>Structural Information and Communication Complexity</i>. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>","mla":"Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” <i>Structural Information and Communication Complexity</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>.","short":"P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.","bibtex":"@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }"},"date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-08T07:20:20Z","author":[{"first_name":"Pascal","full_name":"Bemmann, Pascal","last_name":"Bemmann"},{"full_name":"Biermeier, Felix","last_name":"Biermeier","first_name":"Felix"},{"first_name":"Jan","last_name":"Bürmann","full_name":"Bürmann, Jan"},{"first_name":"Arne","last_name":"Kemper","full_name":"Kemper, Arne"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"last_name":"Knorr","full_name":"Knorr, Steffen","first_name":"Steffen"},{"full_name":"Kothe, Nils","last_name":"Kothe","first_name":"Nils"},{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","id":"41265","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"last_name":"Schaefer","full_name":"Schaefer, Johannes Sebastian","id":"30291","first_name":"Johannes Sebastian"},{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"title":"Monitoring of Domain-Related Problems in Distributed Data Streams","doi":"10.1007/978-3-319-72050-0_13"}]