[{"language":[{"iso":"eng"}],"doi":"10.1145/3490148.3538595","year":"2022","title":"The k-Server with Preferences Problem","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow","id":"38705"},{"id":"22704","first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696"},{"id":"41265","first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"isbn":["9781450391467"]},"date_updated":"2022-08-02T08:07:30Z","date_created":"2022-06-10T09:06:42Z","type":"conference","keyword":["K-Server Problem","Heterogeneity","Online Caching"],"department":[{"_id":"63"}],"publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","abstract":[{"lang":"eng","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."}],"page":"345-356","publisher":"Association for Computing Machinery","_id":"31847","user_id":"39241","status":"public","external_id":{"arxiv":["2205.11102"]},"citation":{"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.","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>.","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>","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>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"user_id":"83983","editor":[{"last_name":"De Raedt","first_name":"Luc","full_name":"De Raedt, Luc"}],"_id":"34040","publisher":"International Joint Conferences on Artificial Intelligence Organization","status":"public","conference":{"start_date":"2022-07-23","name":"THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE","location":"Vienna","end_date":"2022-07-29"},"citation":{"ieee":"G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,” in <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, Vienna, 2022, doi: <a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","apa":"Polevoy, G., &#38; Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>","short":"G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022.","chicago":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” In <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>.","mla":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","bibtex":"@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational and Cheap Adjustment}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>}, booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt, Luc}, year={2022} }","ama":"Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>"},"doi":"10.24963/ijcai.2022/64","main_file_link":[{"url":"https://www.ijcai.org/proceedings/2022/64"}],"language":[{"iso":"eng"}],"date_updated":"2022-11-08T17:34:36Z","publication_status":"published","title":"Fair, Individually Rational and Cheap Adjustment","year":"2022","author":[{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"Dziubiński","first_name":"Marcin","full_name":"Dziubiński, Marcin"}],"keyword":["adjustment","strictly dominant","fairness","individually rational","transfer","tax","subsidy"],"type":"conference","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2022-11-08T16:53:31Z","abstract":[{"text":"<jats:p>Consider the practical goal of making a desired action profile played,\r\n\r\nwhen the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications include motivating people\r\n\r\nto choose the closest school, the closest subway station, or to coordinate\r\n\r\non a communication protocol or an investment strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly. The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we also prove that our adjustment minimises \r\n\r\nthe general transfer among all such adjustments, counting the total subsidising and taxation.</jats:p>","lang":"eng"}],"publication":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"},{"date_created":"2022-08-23T08:10:36Z","type":"conference","department":[{"_id":"63"}],"publication":"39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)","series_title":"LIPIcs","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.STACS.2022.28","year":"2022","title":"Cardinality Constrained Scheduling in Online Models","author":[{"full_name":"Epstein, Leah","first_name":"Leah","last_name":"Epstein"},{"last_name":"Lassota","first_name":"Alexandra","full_name":"Lassota, Alexandra"},{"full_name":"Levin, Asaf","first_name":"Asaf","last_name":"Levin"},{"id":"88252","full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack"},{"full_name":"Rohwedder, Lars","first_name":"Lars","last_name":"Rohwedder"}],"date_updated":"2022-11-08T16:34:32Z","intvolume":"       219","citation":{"ieee":"L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, 2022, vol. 219, p. 28:1–28:15, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","apa":"Epstein, L., Lassota, A., Levin, A., Maack, M., &#38; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &#38; B. Monmege (Eds.), <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i> (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>","mla":"Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","bibtex":"@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }","chicago":"Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>.","ama":"Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>. Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>","short":"L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15."},"project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"page":"28:1–28:15","_id":"33085","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"88252","volume":219,"editor":[{"full_name":"Berenbrink, Petra","last_name":"Berenbrink","first_name":"Petra"},{"first_name":"Benjamin","last_name":"Monmege","full_name":"Monmege, Benjamin"}],"status":"public"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2022-09-27T13:06:05Z","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","doi":"10.4230/LIPIcs.ESA.2022.77","series_title":"LIPIcs","language":[{"iso":"eng"}],"intvolume":"       244","date_updated":"2022-11-18T10:14:14Z","author":[{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"last_name":"Rasmussen","first_name":"Anna Rodriguez","full_name":"Rasmussen, Anna Rodriguez"}],"title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","year":"2022","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"citation":{"short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>."},"volume":244,"editor":[{"first_name":"Shiri","last_name":"Chechik","full_name":"Chechik, Shiri"},{"full_name":"Navarro, Gonzalo","last_name":"Navarro","first_name":"Gonzalo"},{"full_name":"Rotenberg, Eva","first_name":"Eva","last_name":"Rotenberg"},{"full_name":"Herman, Grzegorz","first_name":"Grzegorz","last_name":"Herman"}],"user_id":"477","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"33491","page":"77:1–77:13","status":"public"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"publication":"Algorithmica","citation":{"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} }","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>","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>.","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>.","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (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>.","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>"},"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}],"date_created":"2022-05-27T10:09:24Z","date_updated":"2022-05-27T10:14:27Z","publication_status":"published","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2022","status":"public","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Baswana, Surender","first_name":"Surender","last_name":"Baswana"},{"full_name":"Gupta, Shiv","first_name":"Shiv","last_name":"Gupta"},{"id":"39241","full_name":"Knollmann, Till","first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann"}],"doi":"10.1007/s00453-022-00978-0","user_id":"39241","genbank":["tillk"],"publisher":"Springer Science and Business Media LLC","_id":"31479","language":[{"iso":"eng"}]},{"_id":"29872","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-92702-8_10","user_id":"44428","author":[{"first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten","id":"88252"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop","id":"44428"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030927011","9783030927028"]},"year":"2022","title":"Server Cloud Scheduling","status":"public","date_updated":"2022-09-27T15:03:13Z","publication_status":"published","place":"Cham","date_created":"2022-02-18T09:31:54Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"bibtex":"@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: <i>Approximation and Online Algorithms</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In <i>Approximation and Online Algorithms</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in <i>Approximation and Online Algorithms</i>, Cham: Springer International Publishing, 2022.","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Approximation and Online Algorithms</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2022). Server Cloud Scheduling. In <i>Approximation and Online Algorithms</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>"},"publication":"Approximation and Online Algorithms","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}]},{"user_id":"15504","doi":"10.1016/j.ic.2021.104697","article_number":"104697","language":[{"iso":"eng"}],"_id":"21096","publication_status":"published","date_updated":"2023-03-27T07:56:48Z","status":"public","title":"A self-stabilizing Hashed Patricia Trie","year":"2022","publication_identifier":{"issn":["0890-5401"]},"author":[{"full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till","id":"39241"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"type":"journal_article","department":[{"_id":"63"},{"_id":"79"}],"date_created":"2021-01-29T09:39:40Z","abstract":[{"lang":"eng","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."}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication":"Information and Computation","citation":{"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>","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","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>.","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>.","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} }","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>"}},{"status":"public","conference":{"end_date":"2021-09-10","location":"Lissabon","start_date":"2021-09-09","name":"17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) 2021"},"user_id":"38705","editor":[{"full_name":"Gasieniec, Leszek","first_name":"Leszek","last_name":"Gasieniec"},{"first_name":"Ralf","last_name":"Klasing","full_name":"Klasing, Ralf"},{"first_name":"Tomasz","last_name":"Radzik","full_name":"Radzik, Tomasz"}],"volume":12961,"page":"29 - 44","_id":"23730","publisher":"Springer","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"citation":{"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>","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>.","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>.","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.","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>.","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>","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} }"},"external_id":{"arxiv":["2010.04424"]},"date_updated":"2022-01-06T06:55:58Z","publication_status":"published","intvolume":"     12961","title":"Gathering a Euclidean Closed Chain of Robots in Linear Time","year":"2021","author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"},{"last_name":"Harbig","first_name":"Jonas","full_name":"Harbig, Jonas","id":"47213"},{"last_name":"Jung","first_name":"Daniel","full_name":"Jung, Daniel","id":"37827"},{"orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"doi":"10.1007/978-3-030-89240-1_3","language":[{"iso":"eng"}],"series_title":"LNCS","publication":"Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","type":"conference","department":[{"_id":"63"}],"date_created":"2021-09-03T09:01:25Z"},{"quality_controlled":"1","abstract":[{"lang":"ger","text":"Produktentstehung (PE) bezieht sich auf den Prozess der Planung und Entwicklung eines Produkts sowie der damit verbundenen Dienstleistungen von der ersten Idee bis zur Herstellung und zum Vertrieb. Während dieses Prozesses gibt es zahlreiche Aufgaben, die von menschlichem Fachwissen abhängen und typischerweise von erfahrenen Experten übernommen werden. Da sich das Feld der Künstlichen Intelligenz (KI) immer weiterentwickelt und seinen Weg in den Fertigungssektor findet, gibt es viele Möglichkeiten für eine Anwendung von KI, um bei der Lösung der oben genannten Aufgaben zu helfen. In diesem Paper geben wir einen umfassenden Überblick über den aktuellen Stand der Technik des Einsatzes von KI in der PE. \r\nIm Detail analysieren wir 40 bestehende Surveys zu KI in der PE und 94 Case Studies, um herauszufinden, welche Bereiche der PE von der aktuellen Forschung in diesem Bereich vorrangig adressiert werden, wie ausgereift die diskutierten KI-Methoden sind und inwieweit datenzentrierte Ansätze in der aktuellen Forschung genutzt werden."},{"text":"Product Creation (PC) refers to the process of planning and developing a product as well as related services from the initial idea until manufacturing and distribution. Throughout this process, there are numerous tasks that depend on human expertise and are typically undertaken by experienced practitioners. As the field of Artificial Intelligence (AI) continues to evolve and finds its way into the manufacturing sector, there exist many possibilities for an application of AI in order to assist in solving aforementioned tasks. In this work, we provide a comprehensive overview of the current state of the art of the use of AI in PC. \r\nIn detail, we analyze 40 existing surveys on AI in PC and 94 case studies in order to find out which areas of PC are primarily addressed by current research in this field, how mature the discussed AI methods are, and to which extent data-centric approaches are utilized in current research.","lang":"eng"}],"publication":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)","citation":{"short":"R. Bernijazov, A. Dicks, R. Dumitrescu, M. Foullois, J.M. Hanselle, E. Hüllermeier, G. Karakaya, P. Ködding, V. Lohweg, M. Malatyali, F. Meyer auf der Heide, M. Panzner, C. Soltenborn, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.","chicago":"Bernijazov, Ruslan, Alexander Dicks, Roman Dumitrescu, Marc Foullois, Jonas Manuel Hanselle, Eyke Hüllermeier, Gökce Karakaya, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” In <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>, 2021.","apa":"Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., &#38; Soltenborn, C. (2021). A Meta-Review on Artificial Intelligence in Product Creation. <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>. 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada.","ieee":"R. Bernijazov <i>et al.</i>, “A Meta-Review on Artificial Intelligence in Product Creation,” presented at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada, 2021.","ama":"Bernijazov R, Dicks A, Dumitrescu R, et al. A Meta-Review on Artificial Intelligence in Product Creation. In: <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>. ; 2021.","bibtex":"@inproceedings{Bernijazov_Dicks_Dumitrescu_Foullois_Hanselle_Hüllermeier_Karakaya_Ködding_Lohweg_Malatyali_et al._2021, title={A Meta-Review on Artificial Intelligence in Product Creation}, booktitle={Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)}, author={Bernijazov, Ruslan and Dicks, Alexander and Dumitrescu, Roman and Foullois, Marc and Hanselle, Jonas Manuel and Hüllermeier, Eyke and Karakaya, Gökce and Ködding, Patrick and Lohweg, Volker and Malatyali, Manuel and et al.}, year={2021} }","mla":"Bernijazov, Ruslan, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” <i>Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)</i>, 2021."},"keyword":["Artificial Intelligence Product Creation Literature Review"],"type":"conference","department":[{"_id":"63"},{"_id":"563"},{"_id":"355"},{"_id":"241"}],"date_created":"2021-09-06T08:23:45Z","publication_status":"epub_ahead","date_updated":"2022-01-06T06:55:59Z","status":"public","title":"A Meta-Review on Artificial Intelligence in Product Creation","year":"2021","author":[{"last_name":"Bernijazov","first_name":"Ruslan","full_name":"Bernijazov, Ruslan"},{"full_name":"Dicks, Alexander","first_name":"Alexander","last_name":"Dicks"},{"full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman","id":"16190"},{"full_name":"Foullois, Marc","last_name":"Foullois","first_name":"Marc"},{"id":"43980","full_name":"Hanselle, Jonas Manuel","orcid":"0000-0002-1231-4985","first_name":"Jonas Manuel","last_name":"Hanselle"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"last_name":"Karakaya","first_name":"Gökce","full_name":"Karakaya, Gökce"},{"id":"45402","full_name":"Ködding, Patrick","last_name":"Ködding","first_name":"Patrick"},{"full_name":"Lohweg, Volker","last_name":"Lohweg","first_name":"Volker"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali","id":"41265"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Panzner","first_name":"Melina","full_name":"Panzner, Melina"},{"id":"1737","first_name":"Christian","orcid":"0000-0002-0342-8227","last_name":"Soltenborn","full_name":"Soltenborn, Christian"}],"conference":{"end_date":"2021-08-26","location":"Montreal, Kanada","name":"30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop \"AI and Product Design\"","start_date":"2021-08-19"},"user_id":"15415","main_file_link":[{"url":"https://www.hsu-hh.de/imb/wp-content/uploads/sites/677/2021/08/A-Meta-Review-on-Artificial-Intelligence-in-Product-Creation.pdf"}],"language":[{"iso":"eng"}],"_id":"23779"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-12-08T08:40:10Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publication":"Theory of Computing Systems","citation":{"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>.","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>","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>.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 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>.","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} }","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>"},"user_id":"15415","doi":"10.1007/s00224-020-10023-8","volume":65,"page":"943–984","language":[{"iso":"eng"}],"_id":"20683","publication_status":"published","date_updated":"2022-01-06T06:54:31Z","intvolume":"        65","title":"Managing Multiple Mobile Resources","status":"public","year":"2021","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","last_name":"Feldkord","id":"22704"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel","id":"41265"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"_id":"20817","language":[{"iso":"eng"}],"page":"14:1 - 14:17","doi":"10.4230/LIPIcs.STACS.2021.14","user_id":"22704","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"full_name":"Schmidt, Pawel","last_name":"Schmidt","first_name":"Pawel"}],"status":"public","year":"2021","title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location","date_updated":"2022-01-06T06:54:40Z","publication_status":"published","date_created":"2020-12-21T13:46:16Z","department":[{"_id":"63"}],"type":"conference","citation":{"chicago":"Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 14:1-14:17, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>.","short":"M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.","apa":"Bienkowski, M., Feldkord, B., &#38; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 14:1-14:17). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>","ieee":"M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17.","ama":"Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>. ; 2021:14:1-14:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>","bibtex":"@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }","mla":"Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>."},"publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_updated":"2022-01-06T06:55:35Z","publication_status":"published","intvolume":"       852","year":"2021","title":"A continuous strategy for collisionless gathering","publication_identifier":{"issn":["0304-3975"]},"author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"doi":"10.1016/j.tcs.2020.10.037","language":[{"iso":"eng"}],"abstract":[{"text":"Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art.","lang":"eng"}],"publication":"Theoretical Computer Science","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2021-06-28T09:24:15Z","status":"public","user_id":"15415","volume":852,"page":"41-60","_id":"22510","citation":{"ieee":"S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol. 852, pp. 41–60, 2021.","apa":"Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>, <i>852</i>, 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>","chicago":"Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i> 852 (2021): 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","mla":"Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>.","bibtex":"@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }","ama":"Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>"}},{"citation":{"mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 29–40, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>.","bibtex":"@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>. 2021;852:29-40. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.","apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>."},"user_id":"15415","volume":852,"page":"29-40","_id":"22511","status":"public","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2021-06-28T09:34:45Z","abstract":[{"lang":"eng","text":"In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"}],"publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2020.11.009","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:55:35Z","intvolume":"       852","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","year":"2021","publication_identifier":{"issn":["0304-3975"]},"author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Podlipyan","first_name":"Pavel","full_name":"Podlipyan, Pavel"}]},{"type":"conference","department":[{"_id":"63"}],"date_created":"2021-10-28T07:01:30Z","publication":"Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021","doi":"10.1007/978-3-030-91081-5_19","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-07T15:24:10Z","publication_status":"published","intvolume":"     13046","year":"2021","title":"The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow","id":"38705"},{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till","full_name":"Knollmann, Till"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"external_id":{"arxiv":["2109.11856"]},"project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"citation":{"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} }","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>.","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>","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.","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>.","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>."},"user_id":"38705","editor":[{"last_name":"Johnen","first_name":"C.","full_name":"Johnen, C."},{"last_name":"Schiller","first_name":"E.M.","full_name":"Schiller, E.M."},{"first_name":"S.","last_name":"Schmid","full_name":"Schmid, S."}],"volume":13046,"page":"289-304 ","publisher":"Springer","_id":"26986","status":"public","conference":{"end_date":"2021-11-20","location":"Online","name":"23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems","start_date":"2021-11-17"}},{"language":[{"iso":"eng"}],"_id":"27778","user_id":"44428","author":[{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"id":"44428","full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"}],"year":"2021","title":"Full Version -- Server Cloud Scheduling","status":"public","date_updated":"2022-09-27T15:03:19Z","date_created":"2021-11-24T13:23:58Z","department":[{"_id":"63"},{"_id":"26"}],"type":"preprint","citation":{"chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” <i>ArXiv:2108.02109</i>, 2021.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In <i>arXiv:2108.02109</i>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud Scheduling,” <i>arXiv:2108.02109</i>. 2021.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Full Version -- Server Cloud Scheduling. <i>arXiv:210802109</i>. Published online 2021.","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2021, title={Full Version -- Server Cloud Scheduling}, journal={arXiv:2108.02109}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2021} }","mla":"Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” <i>ArXiv:2108.02109</i>, 2021."},"publication":"arXiv:2108.02109","abstract":[{"lang":"eng","text":"Consider a set of jobs connected to a directed acyclic task graph with a\r\nfixed source and sink. The edges of this graph model precedence constraints and\r\nthe jobs have to be scheduled with respect to those. We introduce the Server\r\nCloud Scheduling problem, in which the jobs have to be processed either on a\r\nsingle local machine or on one of many cloud machines. Both the source and the\r\nsink have to be scheduled on the local machine. For each job, processing times\r\nboth on the server and in the cloud are given. Furthermore, for each edge in\r\nthe task graph, a communication delay is included in the input and has to be\r\ntaken into account if one of the two jobs is scheduled on the server, the other\r\nin the cloud. The server can process jobs sequentially, whereas the cloud can\r\nserve as many as needed in parallel, but induces costs. We consider both\r\nmakespan and cost minimization. The main results are an FPTAS with respect for\r\nthe makespan objective for a fairly general case and strong hardness for the\r\ncase with unit processing times and delays."}]},{"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"citation":{"ama":"Berger TF. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>.; 2021.","bibtex":"@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021} }","mla":"Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>. 2021.","short":"T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.","chicago":"Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>, 2021.","apa":"Berger, T. F. (2021). <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>.","ieee":"T. F. Berger, <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>. 2021."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2023-04-27T15:34:07Z","department":[{"_id":"63"}],"type":"bachelorsthesis","author":[{"full_name":"Berger, Thilo Frederik","last_name":"Berger","first_name":"Thilo Frederik"}],"title":"Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation","status":"public","year":"2021","date_updated":"2023-04-27T15:34:17Z","_id":"44234","language":[{"iso":"eng"}],"user_id":"39241"},{"_id":"44233","language":[{"iso":"eng"}],"user_id":"39241","year":"2021","title":"Online k-Facility Reallocation using k-Server Algorithms","status":"public","author":[{"last_name":"Pranger","first_name":"Sebastian","full_name":"Pranger, Sebastian"}],"date_updated":"2023-04-27T15:31:57Z","date_created":"2023-04-27T15:31:26Z","type":"bachelorsthesis","department":[{"_id":"63"}],"citation":{"short":"S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.","chicago":"Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>, 2021.","apa":"Pranger, S. (2021). <i>Online k-Facility Reallocation using k-Server Algorithms</i>.","ieee":"S. Pranger, <i>Online k-Facility Reallocation using k-Server Algorithms</i>. 2021.","ama":"Pranger S. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>.; 2021.","bibtex":"@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server Algorithms}, author={Pranger, Sebastian}, year={2021} }","mla":"Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>. 2021."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"page":"65-80","_id":"19899","publisher":"Springer","user_id":"38705","editor":[{"last_name":"Devismes ","first_name":"Stéphane ","full_name":"Devismes , Stéphane "},{"full_name":"Mittal, Neeraj ","last_name":"Mittal","first_name":"Neeraj "}],"volume":12514,"status":"public","external_id":{"arxiv":["2010.02043 "]},"citation":{"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.","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.","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>.","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>.","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)} }","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>"},"series_title":"Lecture Notes in Computer Science (LNCS)","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-64348-5_6","year":"2020","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow","id":"38705"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["978-3-030-64347-8"]},"date_updated":"2022-01-06T06:54:14Z","publication_status":"published","intvolume":"     12514","date_created":"2020-10-06T07:27:10Z","type":"conference","department":[{"_id":"63"}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings","abstract":[{"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.","lang":"eng"}]},{"place":"Dagstuhl, Germany","citation":{"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>","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)} }","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>.","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>.","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.","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>","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."},"page":"12:1-12:14","publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik","_id":"20159","user_id":"39241","editor":[{"first_name":"Fabrizio","last_name":"Grandoni","full_name":"Grandoni, Fabrizio"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"},{"last_name":"Sanders","first_name":"Peter","full_name":"Sanders, Peter"}],"volume":173,"status":"public","date_created":"2020-10-21T12:00:20Z","type":"conference","keyword":["Mincut","Sensitivity","Data Structure"],"department":[{"_id":"63"}],"publication":"28th Annual European Symposium on Algorithms (ESA 2020)","abstract":[{"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.","lang":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2020.12","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2020","author":[{"first_name":"Surender","last_name":"Baswana","full_name":"Baswana, Surender"},{"full_name":"Gupta, Shiv","last_name":"Gupta","first_name":"Shiv"},{"id":"39241","full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696"}],"publication_identifier":{"isbn":["978-3-95977-162-7"],"issn":["1868-8969"]},"date_updated":"2022-01-06T06:54:20Z","intvolume":"       173"},{"doi":"10.1007/978-3-030-64348-5_5","series_title":"Lecture Notes in Computer Science (LNCS)","language":[{"iso":"eng"}],"intvolume":"     12514","date_updated":"2022-01-06T06:54:21Z","publication_status":"published","publication_identifier":{"isbn":["978-3-030-64347-8"]},"author":[{"last_name":"Castenow","first_name":"Jannik","full_name":"Castenow, Jannik","id":"38705"},{"first_name":"Jonas","last_name":"Harbig","full_name":"Harbig, Jonas","id":"47213"},{"id":"37827","first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel"},{"orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","year":"2020","department":[{"_id":"63"}],"type":"conference","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 ","editor":[{"last_name":"Devismes","first_name":"Stéphane ","full_name":"Devismes, Stéphane "},{"last_name":" Mittal","first_name":"Neeraj","full_name":" Mittal, Neeraj"}],"volume":12514,"user_id":"38705","publisher":"Springer","_id":"20185","page":"60-64","status":"public","external_id":{"arxiv":["2010.04424 "]},"citation":{"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>","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.","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>.","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.","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>.","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>","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)} }"}}]