[{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:10Z","doi":"10.1145/3350755.3400281","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_identifier":{"isbn":["9781450369350"]},"publication_status":"published","external_id":{"arxiv":["2005.08391"]},"title":"The Online Multi-Commodity Facility Location Problem","citation":{"bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281}, 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} }","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400281.","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400281","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 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."},"type":"conference","year":"2020","_id":"17370","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T07:56:52Z","creator":"tillk","file_id":"17373","file_size":1271416,"access_level":"closed","date_created":"2020-07-14T07:56:52Z","file_name":"3350755.3400281.pdf"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"file_date_updated":"2020-07-14T07:56:52Z","author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"},{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","id":"39241","last_name":"Knollmann"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-07-14T07:53:20Z","status":"public","has_accepted_license":"1","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"}],"user_id":"39241","ddc":["000"]},{"date_updated":"2022-01-06T06:53:10Z","doi":"10.1145/3350755.3400263","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.02043 "]},"title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9781450369350"]},"_id":"17371","type":"conference","year":"2020","citation":{"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={10.1145/3350755.3400263}, 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.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400263.","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: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400263","apa":"Castenow, J., Kling, P., Knollmann, T., & 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 Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400263","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 Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400263.","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 Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.","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."},"ddc":["000"],"user_id":"38705","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","id":"38705","last_name":"Castenow"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"last_name":"Knollmann","id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"file_date_updated":"2020-07-14T07:56:04Z","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","file":[{"access_level":"closed","date_created":"2020-07-14T07:56:04Z","file_name":"3350755.3400263.pdf","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T07:56:04Z","file_id":"17372","creator":"janniksu","file_size":1078544}],"status":"public","has_accepted_license":"1","date_created":"2020-07-14T07:53:47Z"},{"date_updated":"2022-01-06T06:53:00Z","doi":"10.1007/978-3-030-54921-3_4","language":[{"iso":"eng"}],"external_id":{"arxiv":["arXiv:2005.07495"]},"title":"Local Gathering of Mobile Robots in Three Dimensions","department":[{"_id":"63"}],"conference":{"end_date":"2020-07-01","start_date":"2020-06-29","name":"SIROCCO 2020","location":"Paderborn"},"_id":"16968","type":"conference","citation":{"chicago":"Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local Gathering of Mobile Robots in Three Dimensions.” In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3_4.","ama":"Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots in Three Dimensions. In: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Springer; 2020. doi:10.1007/978-3-030-54921-3_4","apa":"Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering of Mobile Robots in Three Dimensions. In Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO). Paderborn: Springer. https://doi.org/10.1007/978-3-030-54921-3_4","bibtex":"@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering of Mobile Robots in Three Dimensions}, DOI={10.1007/978-3-030-54921-3_4}, booktitle={Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow, Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.” Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020, doi:10.1007/978-3-030-54921-3_4.","short":"M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Springer, 2020.","ieee":"M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile Robots in Three Dimensions,” in Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO), Paderborn, 2020."},"year":"2020","abstract":[{"text":"In this work, we initiate the research about the Gathering problem for robots\r\nwith limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering problem, a set of initially scattered robots is required to gather at\r\nthe same position. The robots' capabilities are very restricted -- they do not\r\nagree on any coordinate system or compass, have a limited viewing range, have\r\nno memory of the past and cannot communicate. We study the problem in two\r\ndifferent time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization of contracting strategies (continuous time) from\r\n[Algosensors'17] to three dimensions. In contracting strategies, every robot\r\nthat is located on the global convex hull of all robots' positions moves with\r\nfull speed towards the inside of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$ for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$ close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true in two dimensions. In general, it might be hard for\r\nrobots with limited viewing range to decide whether they are located on the\r\nglobal convex hull and which movement maintains the connectivity of the swarm,\r\nrendering the design of concrete contracting strategies a challenging task. We\r\nprove that the continuous variant of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover, we give a simple design criterion for\r\nthree-dimensional contracting strategies that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy based on this criterion.","lang":"eng"},{"lang":"eng","text":"Best Student Paper Award"}],"user_id":"38705","ddc":["000"],"file":[{"file_size":505712,"file_id":"17504","creator":"janniksu","date_updated":"2020-07-31T08:22:16Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2020-07-31T08:22:16Z","file_name":"localGathering.pdf","access_level":"closed"}],"file_date_updated":"2020-07-31T08:22:16Z","publication":"Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)","publisher":"Springer","author":[{"full_name":"Braun, Michael","first_name":"Michael","last_name":"Braun"},{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-05-18T06:48:35Z","has_accepted_license":"1","status":"public"},{"place":"Universität Paderborn","user_id":"15415","title":"Mobile Resource Allocation","ddc":["000"],"file":[{"file_size":633652,"creator":"florida","file_id":"15634","content_type":"application/pdf","date_updated":"2020-01-24T08:19:38Z","relation":"main_file","success":1,"file_name":"DissertationFeldkord.pdf","date_created":"2020-01-24T08:19:38Z","access_level":"closed"}],"author":[{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"}],"department":[{"_id":"63"}],"file_date_updated":"2020-01-24T08:19:38Z","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-01-23T14:20:25Z","_id":"15631","date_updated":"2022-01-06T06:52:31Z","doi":"10.17619/UNIPB/1-869","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","citation":{"mla":"Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.","bibtex":"@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={10.17619/UNIPB/1-869}, author={Feldkord, Björn}, year={2020} }","ama":"Feldkord B. Mobile Resource Allocation. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-869","apa":"Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869","chicago":"Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-869.","ieee":"B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.","short":"B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020."},"year":"2020"},{"title":"Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets","related_material":{"link":[{"url":"https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266","relation":"confirmation"}]},"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"},{"_id":"63"},{"_id":"238"}],"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_updated":"2022-01-06T06:52:15Z","doi":"10.1162/evco_a_00266","language":[{"iso":"eng"}],"abstract":[{"text":"In software engineering, the imprecise requirements of a user are transformed to a formal requirements specification during the requirements elicitation process. This process is usually guided by requirements engineers interviewing the user. We want to partially automate this first step of the software engineering process in order to enable users to specify a desired software system on their own. With our approach, users are only asked to provide exemplary behavioral descriptions. The problem of synthesizing a requirements specification from examples can partially be reduced to the problem of grammatical inference, to which we apply an active coevolutionary learning approach. However, this approach would usually require many feedback queries to be sent to the user. In this work, we extend and generalize our active learning approach to receive knowledge from multiple oracles, also known as proactive learning. The ‘user oracle’ represents input received from the user and the ‘knowledge oracle’ represents available, formalized domain knowledge. We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q) algorithm. We compare FAKT/Q to the active learning approach and provide an extensive benchmark evaluation. As result we find that the number of required user queries is reduced and the inference process is sped up significantly. Finally, with so-called On-The-Fly Markets, we present a motivation and an application of our approach where such knowledge is available.","lang":"eng"}],"user_id":"15415","publisher":"MIT Press Journals","author":[{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","id":"33176","last_name":"Wever"},{"id":"58843","last_name":"van Rooijen","full_name":"van Rooijen, Lorijn","first_name":"Lorijn"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"publication":"Evolutionary Computation","volume":28,"status":"public","date_created":"2019-11-18T14:19:19Z","_id":"15025","intvolume":" 28","issue":"2","type":"journal_article","year":"2020","citation":{"apa":"Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266","ama":"Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary Computation. 2020;28(2):165–193. doi:10.1162/evco_a_00266","chicago":"Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation 28, no. 2 (2020): 165–193. https://doi.org/10.1162/evco_a_00266.","mla":"Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation, vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.","bibtex":"@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets}, volume={28}, DOI={10.1162/evco_a_00266}, number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals}, author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020}, pages={165–193} }","short":"M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193.","ieee":"M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets,” Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266."},"page":"165–193"},{"conference":{"name":"21st International Conference on Distributed Computing and Networking ","start_date":"04.01.2020","location":"Kolkata, Indien","end_date":"07.01.2020"},"_id":"15169","date_updated":"2022-01-06T06:52:16Z","type":"conference","citation":{"short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.","apa":"Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }"},"year":"2020","language":[{"iso":"eng"}],"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","department":[{"_id":"63"},{"_id":"79"}],"publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","publication_status":"accepted","date_created":"2019-11-25T12:18:41Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public"},{"page":"289-309","type":"journal_article","year":"2020","citation":{"short":"J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309.","ieee":"J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol. 815, pp. 289–309, 2020.","ama":"Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018","apa":"Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018","chicago":"Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.","bibtex":"@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={10.1016/j.tcs.2020.02.018}, journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer, Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2020}, pages={289–309} }","mla":"Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:48Z","_id":"16299","intvolume":" 815","doi":"10.1016/j.tcs.2020.02.018","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Harbig, Jonas","first_name":"Jonas","last_name":"Harbig"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication_status":"published","volume":815,"publication_identifier":{"issn":["0304-3975"]},"date_created":"2020-03-13T12:55:53Z","status":"public","title":"Gathering Anonymous, Oblivious Robots on a Grid","user_id":"38705"},{"_id":"13868","date_updated":"2022-01-06T06:51:45Z","year":"2020","citation":{"apa":"Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).","ama":"Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion Time for Order Scheduling with Setup Times. In: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). ; 2020.","chicago":"Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","mla":"Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","bibtex":"@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2020} }","short":"S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","ieee":"S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted Completion Time for Order Scheduling with Setup Times,” in Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020."},"type":"conference","language":[{"iso":"eng"}],"title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","user_id":"44428","status":"public","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"date_created":"2019-10-15T12:19:49Z","author":[{"last_name":"Pukrop","id":"44428","first_name":"Simon","full_name":"Pukrop, Simon"},{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker","id":"13536"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","department":[{"_id":"63"}]},{"title":"A Case for a New IT Ecosystem: On-The-Fly Computing","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"name":"SFB 901 - T4: SFB 901 -Subproject T4","_id":"158"}],"publication_status":"published","date_updated":"2022-12-02T09:27:17Z","doi":"10.1007/s12599-019-00627-x","language":[{"iso":"eng"}],"user_id":"477","ddc":["004"],"file":[{"date_created":"2019-12-12T10:24:47Z","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","access_level":"closed","file_id":"15311","creator":"ups","file_size":454532,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-12-12T10:24:47Z"}],"publication":"Business & Information Systems Engineering","file_date_updated":"2019-12-12T10:24:47Z","author":[{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"},{"id":"21117","last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","has_accepted_license":"1","status":"public","volume":62,"_id":"13770","intvolume":" 62","issue":"6","page":"467-481","type":"journal_article","year":"2020","citation":{"ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x}, number={6}, journal={Business & Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. 2020;62(6):467-481. doi:10.1007/s12599-019-00627-x","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x"}},{"language":[{"iso":"eng"}],"page":"65:1--65:16","type":"conference","citation":{"ama":"Baswana S, Gupta S, Tulsyan A. Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2019:65:1--65:16. doi:10.4230/LIPICS.MFCS.2019.65","apa":"Baswana, S., Gupta, S., & Tulsyan, A. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (pp. 65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.65","chicago":"Baswana, Surender, Shiv Gupta, and Ayush Tulsyan. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 65:1--65:16. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.65.","bibtex":"@inproceedings{Baswana_Gupta_Tulsyan_2019, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient}, DOI={10.4230/LIPICS.MFCS.2019.65}, booktitle={44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Baswana, Surender and Gupta, Shiv and Tulsyan, Ayush}, year={2019}, pages={65:1--65:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16, doi:10.4230/LIPICS.MFCS.2019.65.","short":"S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019, pp. 65:1--65:16.","ieee":"S. Baswana, S. Gupta, and A. Tulsyan, “Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient,” in 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 2019, pp. 65:1--65:16."},"year":"2019","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","doi":"10.4230/LIPICS.MFCS.2019.65","date_updated":"2022-01-06T06:53:12Z","_id":"17432","date_created":"2020-07-29T07:33:56Z","status":"public","department":[{"_id":"63"}],"publication":"44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)","author":[{"first_name":"Surender","full_name":"Baswana, Surender","last_name":"Baswana"},{"last_name":"Gupta","full_name":"Gupta, Shiv","first_name":"Shiv"},{"first_name":"Ayush","full_name":"Tulsyan, Ayush","last_name":"Tulsyan"}],"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","user_id":"15415","title":"Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient"},{"doi":"10.1109/CSCloud/EdgeCom.2019.000-9","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"series_title":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","title":"Approaches for Collaborative Security Defences in Multi Network Environments","publication_identifier":{"issn":["null"]},"department":[{"_id":"63"},{"_id":"541"}],"_id":"17667","conference":{"name":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)"},"year":"2019","type":"conference","citation":{"short":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.","ieee":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for Collaborative Security Defences in Multi Network Environments,” in 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.","apa":"Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9","ama":"Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative Security Defences in Multi Network Environments. In: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:10.1109/CSCloud/EdgeCom.2019.000-9","chicago":"Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso. “Approaches for Collaborative Security Defences in Multi Network Environments.” In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 113–23. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019. https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9.","mla":"Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.” 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.","bibtex":"@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, title={Approaches for Collaborative Security Defences in Multi Network Environments}, DOI={10.1109/CSCloud/EdgeCom.2019.000-9}, booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)} }"},"page":"113-123","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors"}],"user_id":"83983","abstract":[{"lang":"eng","text":"Resolving distributed attacks benefits from collaboration between networks. We present three approaches for the same multi-domain defensive action that can be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures, and 3) Minimize Propagation. First, we provide a formula to compute efficiency of a defense; then we use this formula to compute the efficiency of the approaches under various circumstances. Finally, we discuss how task execution order and timing influence defense efficiency. Our results show that the Minimize Propagation approach is the most efficient method when defending against the chosen attack."}],"extern":"1","status":"public","date_created":"2020-08-06T15:23:23Z","quality_controlled":"1","author":[{"first_name":"Ralph","full_name":"Koning, Ralph","last_name":"Koning"},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"full_name":"Meijer, Lydia","first_name":"Lydia","last_name":"Meijer"},{"full_name":"de Laat, Cees","first_name":"Cees","last_name":"de Laat"},{"first_name":"Paola","full_name":"Grosso, Paola","last_name":"Grosso"}],"publication":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","keyword":["computer network security","multinetwork environments","multidomain defensive action","task execution order","timing influence defense efficiency","distributed attacks","collaborative security defence approach","minimize propagation approach","minimize countermeasure approach","counteract everywhere approach","Conferences","Cloud computing","Computer crime","Edge computing","Security","Defense Approaches","Multi-Domain Defense","Collaborative Defense","Defense Algorithms","Computer Networks"]},{"related_material":{"link":[{"url":"https://doi.org/10.17619/UNIPB/1-766","relation":"confirmation"}]},"user_id":"15415","title":"Big Data: Sublinear Algorithms for Distributed Data Streams","place":"Universität Paderborn","status":"public","date_created":"2020-09-04T07:39:47Z","author":[{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"}],"department":[{"_id":"63"}],"doi":"10.17619/UNIPB/1-766","_id":"18975","date_updated":"2022-01-06T06:53:56Z","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"dissertation","citation":{"short":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.","ieee":"M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.","chicago":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-766.","ama":"Malatyali M. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-766","apa":"Malatyali, M. (2019). Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-766","bibtex":"@book{Malatyali_2019, place={Universität Paderborn}, title={Big Data: Sublinear Algorithms for Distributed Data Streams}, DOI={10.17619/UNIPB/1-766}, author={Malatyali, Manuel}, year={2019} }","mla":"Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766."},"year":"2019"},{"ddc":["000"],"user_id":"15415","abstract":[{"text":"This thesis investigates approximate pure Nash equilibria in different game-theoretic models. In such an outcome, no player can improve her objective by more than a given factor through a deviation to another strategy. In the first part, we investigate two variants of Congestion Games in which the existence of pure Nash equilibria is guaranteed through a potential function argument. However, the computation of such equilibria might be hard. We construct and analyze approximation algorithms that enable the computation of states with low approximation factors in polynomial time. To show their guarantees we use sub games among players, bound the potential function values of arbitrary states and exploit a connection between Shapley and proportional cost shares. Furthermore, we apply and analyze sampling techniques for the computation of approximate Shapley values in different settings. In the second part, we concentrate on the existence of approximate pure Nash equilibria in games in which no pure Nash equilibria exist in general. In the model of Coevolving Opinion Formation Games, we bound the approximation guarantees for natural states nearly independent of the specific definition of the players' neighborhoods by applying a concept of virtual costs. For the special case of only one influential neighbor, we even show lower approximation factors for a natural strategy. Then, we investigate a two-sided Facility Location Game among facilities and clients on a line with an objective function consisting of distance and load. We show tight bounds on the approximation factor for settings with three facilities and infinitely many clients. For the general scenario with an arbitrary number of facilities, we bound the approximation factor for two promising candidates, namely facilities that are uniformly distributed and which are paired.","lang":"eng"}],"date_created":"2019-02-25T13:03:02Z","status":"public","has_accepted_license":"1","file_date_updated":"2019-03-28T13:40:51Z","author":[{"id":"14052","last_name":"Feldotto","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias"}],"file":[{"file_size":3116177,"file_id":"8715","creator":"ups","content_type":"application/pdf","date_updated":"2019-03-28T13:40:51Z","success":1,"relation":"main_file","date_created":"2019-03-28T13:40:51Z","file_name":"Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games.pdf","access_level":"closed"}],"_id":"8080","type":"dissertation","citation":{"short":"M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019.","ieee":"M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019.","chicago":"Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-588.","ama":"Feldotto M. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-588","apa":"Feldotto, M. (2019). Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-588","bibtex":"@book{Feldotto_2019, place={Universität Paderborn}, title={Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games}, DOI={10.17619/UNIPB/1-588}, author={Feldotto, Matthias}, year={2019} }","mla":"Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588."},"year":"2019","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"main_file_link":[{"url":"http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true"}],"title":"Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games","place":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"541"},{"_id":"63"}],"doi":"10.17619/UNIPB/1-588","date_updated":"2022-01-06T07:03:50Z","language":[{"iso":"eng"}]},{"user_id":"13536","title":"Scheduling on (Un-)Related Machines with Setup Times","date_created":"2019-04-09T11:28:46Z","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901"}],"status":"public","publication":"Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)","department":[{"_id":"63"}],"author":[{"last_name":"Jansen","full_name":"Jansen, Klaus","first_name":"Klaus"},{"last_name":"Maack","full_name":"Maack, Marten","first_name":"Marten"},{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"}],"publisher":"IEEE","date_updated":"2022-01-06T07:04:04Z","_id":"8866","language":[{"iso":"eng"}],"page":"145 - 154","citation":{"mla":"Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.” Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–54.","bibtex":"@inproceedings{Jansen_Maack_Mäcker_2019, title={Scheduling on (Un-)Related Machines with Setup Times}, booktitle={Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Jansen, Klaus and Maack, Marten and Mäcker, Alexander}, year={2019}, pages={145–154} }","chicago":"Jansen, Klaus, Marten Maack, and Alexander Mäcker. “Scheduling on (Un-)Related Machines with Setup Times.” In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 145–54. IEEE, 2019.","apa":"Jansen, K., Maack, M., & Mäcker, A. (2019). Scheduling on (Un-)Related Machines with Setup Times. In Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 145–154). IEEE.","ama":"Jansen K, Maack M, Mäcker A. Scheduling on (Un-)Related Machines with Setup Times. In: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2019:145-154.","ieee":"K. Jansen, M. Maack, and A. Mäcker, “Scheduling on (Un-)Related Machines with Setup Times,” in Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019, pp. 145–154.","short":"K. Jansen, M. Maack, A. Mäcker, in: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–154."},"year":"2019","type":"conference"},{"citation":{"ieee":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: 10.1609/aaai.v33i01.33011973.","short":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.","bibtex":"@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={ Multi-unit Bilateral Trade}, DOI={10.1609/aaai.v33i01.33011973}, booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }","mla":"Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.","chicago":"Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019. https://doi.org/10.1609/aaai.v33i01.33011973.","ama":"Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B. Multi-unit Bilateral Trade. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). ; 2019. doi:10.1609/aaai.v33i01.33011973","apa":"Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., & de Keijzer, B. (2019). Multi-unit Bilateral Trade. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI). Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. https://doi.org/10.1609/aaai.v33i01.33011973"},"type":"conference","year":"2019","_id":"5471","conference":{"end_date":"2019-02-01","name":"Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","start_date":"2019-01-27","location":"Honolulu, Hawaii, USA"},"status":"public","has_accepted_license":"1","date_created":"2018-11-12T09:38:16Z","author":[{"full_name":"Lazos, Philip","first_name":"Philip","last_name":"Lazos"},{"full_name":"Goldberg, Paul","first_name":"Paul","last_name":"Goldberg"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"},{"full_name":"Gerstgrasser, Matthias","first_name":"Matthias","last_name":"Gerstgrasser"},{"last_name":"de Keijzer","first_name":"Bart","full_name":"de Keijzer, Bart"}],"publication":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","file_date_updated":"2018-12-06T13:57:51Z","file":[{"file_name":"1811.05130.pdf","date_created":"2018-12-06T13:57:51Z","access_level":"closed","file_size":315877,"file_id":"6018","creator":"feldi","content_type":"application/pdf","date_updated":"2018-12-06T13:57:51Z","success":1,"relation":"main_file"}],"ddc":["000"],"user_id":"15415","abstract":[{"text":"We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. \r\nFurthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1609/aaai.v33i01.33011973","date_updated":"2022-01-06T07:01:55Z","publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"541"},{"_id":"63"}],"title":" Multi-unit Bilateral Trade"},{"doi":"10.1007/978-3-030-39479-0_9","_id":"12870","date_updated":"2022-01-06T06:51:20Z","type":"conference","citation":{"ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.","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.","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9.","bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={10.1007/978-3-030-39479-0_9}, 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} }","apa":"Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2019:120-137. doi:10.1007/978-3-030-39479-0_9","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer, 2019. https://doi.org/10.1007/978-3-030-39479-0_9."},"year":"2019","page":"120 - 137","language":[{"iso":"eng"}],"title":"Managing Multiple Mobile Resources","user_id":"22704","external_id":{"arxiv":["1907.09834"]},"publication_status":"published","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2019-07-22T09:00:05Z","publisher":"Springer","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","id":"39241","last_name":"Knollmann"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","department":[{"_id":"63"}]},{"doi":"10.17619/UNIPB/1-828","_id":"14851","date_updated":"2022-01-06T06:52:08Z","year":"2019","citation":{"bibtex":"@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling with Setup Times}, DOI={10.17619/UNIPB/1-828}, author={Mäcker, Alexander}, year={2019} }","mla":"Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828.","ama":"Mäcker A. On Scheduling with Setup Times. Universität Paderborn; 2019. doi:10.17619/UNIPB/1-828","apa":"Mäcker, A. (2019). On Scheduling with Setup Times. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-828","chicago":"Mäcker, Alexander. On Scheduling with Setup Times. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-828.","ieee":"A. Mäcker, On Scheduling with Setup Times. Universität Paderborn, 2019.","short":"A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019."},"type":"dissertation","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"ddc":["000"],"title":"On Scheduling with Setup Times","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-828"}]},"user_id":"15415","place":"Universität Paderborn","status":"public","date_created":"2019-11-07T14:17:05Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"author":[{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"}],"department":[{"_id":"63"}]},{"author":[{"id":"11648","last_name":"Brandt","full_name":"Brandt, Sascha","orcid":"0000-0003-3546-203X","first_name":"Sascha"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"arXiv:1904.08225","status":"public","date_created":"2020-03-24T08:59:44Z","abstract":[{"text":"We present a technique for rendering highly complex 3D scenes in real-time by\r\ngenerating uniformly distributed points on the scene's visible surfaces. The\r\ntechnique is applicable to a wide range of scene types, like scenes directly\r\nbased on complex and detailed CAD data consisting of billions of polygons (in\r\ncontrast to scenes handcrafted solely for visualization). This allows to\r\nvisualize such scenes smoothly even in VR on a HMD with good image quality,\r\nwhile maintaining the necessary frame-rates. In contrast to other point based\r\nrendering methods, we place points in an approximated blue noise distribution\r\nonly on visible surfaces and store them in a highly GPU efficient data\r\nstructure, allowing to progressively refine the number of rendered points to\r\nmaximize the image quality for a given target frame rate. Our evaluation shows\r\nthat scenes consisting of a high amount of polygons can be rendered with\r\ninteractive frame rates with good visual quality on standard hardware.","lang":"eng"}],"external_id":{"arxiv":["1904.08225"]},"title":"Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels","user_id":"15415","main_file_link":[{"open_access":"1"}],"year":"2019","type":"preprint","citation":{"ieee":"S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels,” arXiv:1904.08225. 2019.","short":"S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225 (2019).","mla":"Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.","bibtex":"@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels}, journal={arXiv:1904.08225}, author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2019} }","chicago":"Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019.","apa":"Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225.","ama":"Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. arXiv:190408225. 2019."},"language":[{"iso":"eng"}],"_id":"16341","date_updated":"2022-01-06T06:52:49Z","oa":"1"},{"ddc":["000"],"user_id":"15504","volume":6,"status":"public","has_accepted_license":"1","date_created":"2019-10-16T07:06:22Z","author":[{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"ACM Transactions on Parallel Computing (TOPC)","file_date_updated":"2020-01-24T08:12:58Z","file":[{"date_created":"2020-01-24T08:12:58Z","file_name":"DissertationFeldkord.pdf","access_level":"closed","creator":"florida","file_id":"15632","file_size":633652,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-01-24T08:12:58Z"}],"article_number":"14","issue":"3","_id":"13873","intvolume":" 6","type":"journal_article","year":"2019","citation":{"short":"B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 2019.","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC). 2019;6(3). doi:10.1145/3364204","apa":"Feldkord, B., & Meyer auf der Heide, F. (2019). The Mobile Server Problem. ACM Transactions on Parallel Computing (TOPC), 6(3). https://doi.org/10.1145/3364204","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC) 6, no. 3 (2019). https://doi.org/10.1145/3364204.","bibtex":"@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem}, volume={6}, DOI={10.1145/3364204}, number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2019} }","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 14, 2019, doi:10.1145/3364204."},"title":"The Mobile Server Problem","publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"doi":"10.1145/3364204","date_updated":"2022-01-06T06:51:46Z","language":[{"iso":"eng"}]},{"_id":"13937","intvolume":" 66","date_updated":"2022-01-06T06:51:47Z","doi":"10.1007/s00591-019-00249-0","issue":"2","type":"journal_article","year":"2019","citation":{"ieee":"F. Meyer auf der Heide, “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln,” Mathematische Semesterberichte, vol. 66, no. 2, pp. 259–260, 2019.","short":"F. Meyer auf der Heide, Mathematische Semesterberichte 66 (2019) 259–260.","bibtex":"@article{Meyer auf der Heide_2019, title={Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln}, volume={66}, DOI={10.1007/s00591-019-00249-0}, number={2}, journal={Mathematische Semesterberichte}, author={Meyer auf der Heide, Friedhelm}, year={2019}, pages={259–260} }","mla":"Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte, vol. 66, no. 2, 2019, pp. 259–60, doi:10.1007/s00591-019-00249-0.","chicago":"Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln.” Mathematische Semesterberichte 66, no. 2 (2019): 259–60. https://doi.org/10.1007/s00591-019-00249-0.","apa":"Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte, 66(2), 259–260. https://doi.org/10.1007/s00591-019-00249-0","ama":"Meyer auf der Heide F. Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. Mathematische Semesterberichte. 2019;66(2):259-260. doi:10.1007/s00591-019-00249-0"},"page":"259-260","language":[{"iso":"ger"}],"title":"Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln","user_id":"15415","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Mathematische Semesterberichte","department":[{"_id":"63"}],"volume":66,"publication_status":"published","status":"public","date_created":"2019-10-21T08:54:14Z"},{"doi":"10.1007/978-3-030-11072-7\\_13","intvolume":" 11340","_id":"13939","date_updated":"2022-01-06T06:51:47Z","language":[{"iso":"eng"}],"year":"2019","citation":{"short":"P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Springer, 2019, pp. 317–334.","ieee":"P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–334.","apa":"Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm Robotics. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\\_13","ama":"Kling P, Meyer auf der Heide F. Continuous Protocols for Swarm Robotics. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Vol 11340. Lecture Notes in Computer Science. Springer; 2019:317-334. doi:10.1007/978-3-030-11072-7\\_13","chicago":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” In Distributed Computing by Mobile Entities, Current Research in Moving and Computing, 11340:317–34. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-11072-7\\_13.","bibtex":"@inbook{Kling_Meyer auf der Heide_2019, series={Lecture Notes in Computer Science}, title={Continuous Protocols for Swarm Robotics}, volume={11340}, DOI={10.1007/978-3-030-11072-7\\_13}, booktitle={Distributed Computing by Mobile Entities, Current Research in Moving and Computing}, publisher={Springer}, author={Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2019}, pages={317–334}, collection={Lecture Notes in Computer Science} }","mla":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\\_13."},"type":"book_chapter","page":"317-334","series_title":"Lecture Notes in Computer Science","user_id":"15415","title":"Continuous Protocols for Swarm Robotics","status":"public","date_created":"2019-10-21T13:20:43Z","volume":11340,"publisher":"Springer","author":[{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Distributed Computing by Mobile Entities, Current Research in Moving and Computing","department":[{"_id":"63"}]},{"type":"conference","year":"2019","citation":{"chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 315–21. SciTePress, 2019. https://doi.org/10.5220/0007369503150321.","ama":"Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems. SciTePress; 2019:315-321. doi:10.5220/0007369503150321","apa":"Markarian, C., & Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems (pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={10.5220/0007369503150321}, booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321."},"page":"315-321","language":[{"iso":"eng"}],"doi":"10.5220/0007369503150321","_id":"13942","date_updated":"2022-01-06T06:51:47Z","status":"public","date_created":"2019-10-21T13:42:50Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"publisher":"SciTePress","author":[{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","title":"Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location","user_id":"477"},{"language":[{"iso":"eng"}],"page":"2-12","type":"journal_article","year":"2019","citation":{"short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science 786 (2019): 2–12. https://doi.org/10.1016/j.tcs.2018.11.006.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient parallel algorithms for parameterized problems. Theoretical Computer Science. 2019;786:2-12. doi:10.1016/j.tcs.2018.11.006","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. Theoretical Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006","bibtex":"@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient parallel algorithms for parameterized problems}, volume={786}, DOI={10.1016/j.tcs.2018.11.006}, journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2019}, pages={2–12} }","mla":"Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006."},"doi":"10.1016/j.tcs.2018.11.006","intvolume":" 786","_id":"13946","date_updated":"2022-01-06T06:51:48Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2019-10-21T13:57:06Z","status":"public","volume":786,"publication":"Theoretical Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N."},{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Podlipyan","first_name":"Pavel","full_name":"Podlipyan, Pavel"}],"user_id":"15415","title":"Efficient parallel algorithms for parameterized problems"},{"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2019-11-04T10:09:35Z","status":"public","publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"doi":"10.1007/978-3-030-24922-9\\_26","conference":{"name":"SIROCCO 2019","start_date":"2019-07-01","location":"L'Aquila, Italy","end_date":"2019-07-04"},"_id":"14539","date_updated":"2022-01-06T06:52:00Z","page":"345-348","type":"conference","year":"2019","citation":{"ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\\_26.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\\_26.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\\_26","apa":"Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\\_26"},"language":[{"iso":"eng"}]},{"department":[{"_id":"541"},{"_id":"63"}],"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"title":" From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:33Z","author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"last_name":"Lenzner","first_name":"Pascal ","full_name":"Lenzner, Pascal "},{"last_name":"Molitor","full_name":"Molitor, Louise","first_name":"Louise"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","publication":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems","file_date_updated":"2019-08-26T11:10:02Z","file":[{"access_level":"closed","file_name":"1903.04265.pdf","date_created":"2019-08-26T11:10:02Z","success":1,"relation":"main_file","date_updated":"2019-08-26T11:10:02Z","content_type":"application/pdf","file_id":"12962","creator":"ups","file_size":698599}],"status":"public","has_accepted_license":"1","date_created":"2019-06-20T14:46:08Z","abstract":[{"lang":"eng","text":"Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare."}],"ddc":["004"],"user_id":"477","main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3331973"}],"type":"conference","citation":{"bibtex":"@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}, booktitle={Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal and Molitor, Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }","mla":"Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","chicago":"Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.","ama":"Feldotto M, Lenzner P, Molitor L, Skopalik A. From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.","apa":"Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems.","ieee":"M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal QC, Canada, 2019, pp. 1949--1951.","short":"M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951."},"year":"2019","page":"1949--1951","_id":"10281","conference":{"location":"Montreal QC, Canada","name":"18th International Conference on Autonomous Agents and MultiAgent Systems"}},{"author":[{"first_name":"Simon","full_name":"Pukrop, Simon","last_name":"Pukrop"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"date_created":"2019-07-04T07:21:19Z","title":"Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine","user_id":"477","year":"2019","citation":{"mla":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","bibtex":"@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2019} }","ama":"Pukrop S. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn; 2019.","apa":"Pukrop, S. (2019). Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn.","chicago":"Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","ieee":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine. Universität Paderborn, 2019.","short":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019."},"type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_updated":"2022-01-06T06:50:37Z","_id":"10344"},{"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:39Z","doi":"10.4230/LIPIcs.ICALP.2018.51","department":[{"_id":"541"},{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"editor":[{"last_name":"Chatzigiannakis","first_name":"Ioannis","full_name":"Chatzigiannakis, Ioannis"},{"full_name":"Kaklamanis, Christos","first_name":"Christos","last_name":"Kaklamanis"},{"full_name":"Marx, Dániel","first_name":"Dániel","last_name":"Marx"},{"last_name":"Sannella","full_name":"Sannella, Donald","first_name":"Donald"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"external_id":{"arxiv":["1711.01231"]},"place":"Dagstuhl, Germany","title":"Fully-Dynamic Bin Packing with Little Repacking","page":"51:1-51:24","citation":{"short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","ieee":"B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51","ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={10.4230/LIPIcs.ICALP.2018.51}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"year":"2018","type":"conference","conference":{"end_date":"2018-07-13","start_date":"2018-07-10","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","location":"Prag"},"_id":"2484","intvolume":" 107","publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","file_date_updated":"2018-10-31T16:58:18Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"first_name":"Anupam","full_name":"Gupta, Anupam","last_name":"Gupta"},{"last_name":"Guruganesh","first_name":"Guru","full_name":"Guruganesh, Guru"},{"full_name":"Kumar, Amit ","first_name":"Amit ","last_name":"Kumar"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"full_name":"Wajc, David","first_name":"David","last_name":"Wajc"}],"file":[{"date_updated":"2018-10-31T16:58:18Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":723824,"file_id":"5227","creator":"feldi","access_level":"closed","date_created":"2018-10-31T16:58:18Z","file_name":"LIPIcs-ICALP-2018-51.pdf"}],"volume":107,"date_created":"2018-04-24T15:21:56Z","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure."}],"ddc":["000"],"user_id":"14052"},{"file":[{"creator":"ups","file_id":"5280","file_size":1207546,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-02T14:42:33Z","file_name":"p373-feldkord.pdf","date_created":"2018-11-02T14:42:33Z","access_level":"closed"}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T14:42:33Z","publisher":"ACM","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2018-04-25T08:49:43Z","status":"public","has_accepted_license":"1","user_id":"477","ddc":["000"],"page":"373 - 381 ","type":"conference","citation":{"ieee":"B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility Location with Mobile Facilities}, DOI={10.1145/3210377.3210389}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2018}, pages={373–381} }","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.","apa":"Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389","ama":"Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389"},"year":"2018","conference":{"location":"Wien","name":"SPAA'18"},"_id":"2485","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_status":"published","title":"Online Facility Location with Mobile Facilities","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:39Z","doi":"10.1145/3210377.3210389"},{"file":[{"access_level":"local","date_created":"2021-09-29T12:21:24Z","file_name":"Bachelor - Thesis.pdf","content_type":"application/pdf","date_updated":"2021-09-29T12:21:24Z","relation":"main_file","file_size":6746519,"creator":"liedtke","file_id":"25124"}],"author":[{"id":"55557","last_name":"Liedtke","full_name":"Liedtke, David Jan","first_name":"David Jan"}],"file_date_updated":"2021-09-29T12:21:24Z","department":[{"_id":"63"}],"has_accepted_license":"1","status":"public","date_created":"2021-09-29T12:30:40Z","abstract":[{"lang":"eng","text":"We consider a group of $n$ autonomous mobile robots of which $m$ are stationary thus cannot move. Robots are represented by points in the Euclidean plane. They have no memory, do not communicate or share a common coordinate system and they move solely based on the positioning of other robots within their limited viewing range of 1. The goal is to gather the robots inside of the convex hull of all stationary robots. A variant of this problem, the general gathering problem, has been studied in various different time models. In this work, we consider a continuous time model, where robots continuously observe their neighbors, compute the next target of movement and move with a speed limit of 1 at any time. Regarding the robots' local strategy, we only study contracting algorithms in which every robot that is positioned on the border of the convex hull of all robots moves into this hull. We present a time bound of $\\mathcal{O}(nd)$ for any general contracting algorithms in a configuration with only a single stationary robot. For configurations with more stationary robots, we prove that robots converge against the convex hull of all stationary robots and that no upper bound on the runtime exists. For the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle, we provide linear time bounds."}],"user_id":"55557","ddc":["000"],"title":"Influence of Stationary Robots on Continuous Robot Formation Problems","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"2018","citation":{"short":"D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.","ieee":"D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018.","chicago":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018.","ama":"Liedtke DJ. Influence of Stationary Robots on Continuous Robot Formation Problems.; 2018.","apa":"Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot Formation Problems.","bibtex":"@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }","mla":"Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018."},"type":"bachelorsthesis","_id":"25121","date_updated":"2022-01-06T06:56:52Z"},{"department":[{"_id":"63"}],"publication":"arXiv:1805.02994","author":[{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian"}],"date_created":"2020-10-12T12:42:54Z","status":"public","abstract":[{"text":"We introduce the \\emph{Online Connected Dominating Set Leasing} problem\r\n(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set\r\n$\\mathcal{L}$ of lease types each characterized by a duration and cost, and a\r\nsequence of subsets of $V$ arriving over time. A node can be leased using lease\r\ntype $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives\r\nin each step $t$ a subset of nodes that need to be dominated by a connected\r\nsubgraph consisting of nodes active at time $t$. The goal is to minimize the\r\ntotal leasing costs. OCDSL contains the \\emph{Parking Permit\r\nProblem}~\\cite{PPP} as a special subcase and generalizes the classical offline\r\n\\emph{Connected Dominating Set} problem~\\cite{Guha1998}. It has an $\\Omega(\\log\r\n^2 n + \\log |\\mathcal{L}|)$ randomized lower bound resulting from lower bounds\r\nfor the \\emph{Parking Permit Problem} and the \\emph{Online Set Cover}\r\nproblem~\\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\\mathcal{L}|$ is the\r\nnumber of available lease types and $n$ is the number of nodes in the input\r\ngraph. We give a randomized $\\mathcal{O}(\\log ^2 n + \\log |\\mathcal{L}| \\log\r\nn)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for\r\na variant of OCDSL in which the dominating subgraph need not be connected, the\r\n\\emph{Online Dominating Set Leasing} problem. The latter is based on a simple\r\nprimal-dual approach and has an $\\mathcal{O}(|\\mathcal{L}| \\cdot\r\n\\Delta)$-competitive ratio, where $\\Delta$ is the maximum degree of the input\r\ngraph.","lang":"eng"}],"user_id":"15415","title":"Online Connected Dominating Set Leasing","language":[{"iso":"eng"}],"type":"preprint","citation":{"bibtex":"@article{Markarian_2018, title={Online Connected Dominating Set Leasing}, journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }","mla":"Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.","apa":"Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.","ama":"Markarian C. Online Connected Dominating Set Leasing. arXiv:180502994. 2018.","chicago":"Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018.","ieee":"C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994. 2018.","short":"C. Markarian, ArXiv:1805.02994 (2018)."},"year":"2018","date_updated":"2022-01-06T06:54:17Z","_id":"19978"},{"title":"Disaggregating User Evaluations Using the Shapley Value","department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"publication_identifier":{"isbn":["978-1-4503-5916-0"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_updated":"2022-01-06T06:58:01Z","doi":"10.1145/3230654.3230659","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete."}],"ddc":["040"],"user_id":"14052","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"id":"20801","last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"},{"full_name":"Stroh-Maraun, Nadja","first_name":"Nadja","id":"13264","last_name":"Stroh-Maraun"}],"file_date_updated":"2018-08-15T07:30:50Z","publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-08-15T07:30:50Z","creator":"nmaraun","file_id":"3910","file_size":1450171,"access_level":"closed","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","date_created":"2018-08-15T07:30:50Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-05-22T10:28:51Z","_id":"2831","conference":{"name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)","start_date":"2018-06-18","location":"Irvine, California, USA","end_date":"2018-06-18"},"year":"2018","type":"conference","citation":{"short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6.","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA. https://doi.org/10.1145/3230654.3230659","ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659","chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659."},"page":"5:1-5:6"},{"ddc":["000"],"user_id":"477","author":[{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Springer","file_date_updated":"2018-11-02T15:18:16Z","publication":"Algorithmica","file":[{"file_size":600583,"creator":"ups","file_id":"5298","date_updated":"2018-11-02T15:18:16Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"TowardsFlexibleDemandsInOnline.pdf","date_created":"2018-11-02T15:18:16Z","access_level":"closed"}],"volume":80,"status":"public","has_accepted_license":"1","date_created":"2018-05-24T08:32:38Z","_id":"2848","intvolume":" 80","issue":"5","year":"2018","type":"journal_article","citation":{"chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5 (2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.","apa":"Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574, 2018."},"page":"1556–1574","title":"Towards Flexible Demands in Online Leasing Problems. ","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"date_updated":"2022-01-06T06:58:06Z","doi":"10.1007/s00453-018-0420-y","language":[{"iso":"eng"}]},{"date_created":"2018-05-24T08:39:15Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-11-02T15:24:32Z","publication":"Theory of Computing Systems","publisher":"Springer","author":[{"full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. ","last_name":"Abu-Khzam"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Schubert","first_name":"Michael","full_name":"Schubert, Michael"}],"file":[{"file_size":1371624,"file_id":"5301","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T15:24:32Z","success":1,"relation":"main_file","date_created":"2018-11-02T15:24:32Z","file_name":"ApproximationAndHeuristicAlgor.pdf","access_level":"closed"}],"ddc":["000"],"user_id":"477","citation":{"bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={10.1007/s00224-017-9836-z}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018)."},"year":"2018","type":"journal_article","_id":"2849","publication_identifier":{"unknown":["1432-4350"]},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9836-z","date_updated":"2022-01-06T06:58:06Z"},{"has_accepted_license":"1","status":"public","date_created":"2018-05-24T08:41:48Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Ninth International Conference on Fun with Algorithms (FUN)","file_date_updated":"2018-11-13T13:15:19Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-13T13:15:19Z","creator":"feldi","file_id":"5536","file_size":554298,"access_level":"closed","date_created":"2018-11-13T13:15:19Z","file_name":"LIPIcs-FUN-2018-22.pdf"}],"ddc":["000"],"title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","user_id":"15415","type":"conference","year":"2018","citation":{"apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018). Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018. doi:10.4230/LIPIcs.FUN.2018.22","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In Ninth International Conference on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in Ninth International Conference on Fun with Algorithms (FUN), 2018."},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.FUN.2018.22","date_updated":"2022-01-06T06:58:07Z","_id":"2850"},{"type":"conference","year":"2018","citation":{"mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA), 2018, doi:10.1007/978-3-319-94667-2_18.","bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA). ; 2018. doi:10.1007/978-3-319-94667-2_18","apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA). https://doi.org/10.1007/978-3-319-94667-2_18","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms (IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.","ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.","short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:19Z","_id":"24396","doi":"10.1007/978-3-319-94667-2_18","author":[{"last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"}],"publication":"International Workshop on Combinatorial Algorithms (IWOCA)","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2021-09-14T12:23:29Z","place":"Cham","abstract":[{"lang":"eng","text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively."}],"title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","user_id":"15415"},{"date_updated":"2022-01-06T06:59:24Z","doi":"10.1007/s10878-018-0325-3","language":[{"iso":"eng"}],"title":"Scheduling with interjob communication on parallel processors","department":[{"_id":"63"}],"project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"intvolume":" 36","_id":"3551","issue":"4","page":"1356-1379","citation":{"bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization. 2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379."},"type":"journal_article","year":"2018","user_id":"477","ddc":["000"],"file":[{"date_created":"2018-11-02T15:20:24Z","file_name":"SchedulingWithInterjobCommunic.pdf","access_level":"closed","creator":"ups","file_id":"5299","file_size":745708,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T15:20:24Z"}],"publication":"Journal of Combinatorial Optimization","file_date_updated":"2018-11-02T15:20:24Z","author":[{"id":"22358","last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"},{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"date_created":"2018-07-13T09:57:48Z","has_accepted_license":"1","status":"public","volume":36},{"title":"Congestion Games mit gewichteten Strategien","user_id":"14052","date_created":"2018-08-08T11:56:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","department":[{"_id":"541"},{"_id":"63"}],"author":[{"last_name":"Koop","full_name":"Koop, Samuel","first_name":"Samuel"}],"publisher":"Universität Paderborn","_id":"3851","date_updated":"2022-01-06T06:59:45Z","year":"2018","type":"bachelorsthesis","citation":{"ama":"Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn; 2018.","apa":"Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.","chicago":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","mla":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","ieee":"S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018."},"language":[{"iso":"ger"}],"supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}]},{"publication":"Combinatorial Optimization and Applications","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"publisher":"Springer International Publishing","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Trajanovski","first_name":"Stojan","full_name":"Trajanovski, Stojan"},{"last_name":"Grosso","first_name":"Paola","full_name":"Grosso, Paola"},{"last_name":"de Laat","full_name":"de Laat, Cees","first_name":"Cees"}],"date_created":"2020-08-06T15:19:36Z","status":"public","abstract":[{"lang":"eng","text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming."}],"extern":"1","user_id":"83983","page":"217-232","citation":{"chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing.","mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232."},"type":"conference","year":"2018","_id":"17651","department":[{"_id":"63"},{"_id":"541"}],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"editor":[{"full_name":"Kim, Donghyun","first_name":"Donghyun","last_name":"Kim"},{"first_name":"R. N.","full_name":"Uma, R. N.","last_name":"Uma"},{"first_name":"Alexander","full_name":"Zelikovsky, Alexander","last_name":"Zelikovsky"}],"place":"Cham","title":"Removing Undesirable Flows by Edge Deletion","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z"},{"keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"department":[{"_id":"63"},{"_id":"541"}],"publication":"Future Generation Computer Systems","author":[{"last_name":"Koning","full_name":"Koning, R.","first_name":"R."},{"full_name":"de Graaff, B.","first_name":"B.","last_name":"de Graaff"},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"last_name":"Meijer","first_name":"R.","full_name":"Meijer, R."},{"last_name":"de Laat","first_name":"C.","full_name":"de Laat, C."},{"last_name":"Grosso","first_name":"P.","full_name":"Grosso, P."}],"publication_identifier":{"issn":["0167-739X"]},"date_created":"2020-08-06T15:23:11Z","status":"public","extern":"1","abstract":[{"text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.","lang":"eng"}],"title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","user_id":"83983","citation":{"short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).","ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” Future Generation Computer Systems, 2018.","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011.","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={https://doi.org/10.1016/j.future.2018.08.011}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }","mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018, doi:https://doi.org/10.1016/j.future.2018.08.011."},"year":"2018","type":"journal_article","language":[{"iso":"eng"}],"_id":"17666","date_updated":"2022-01-06T06:53:16Z","doi":"https://doi.org/10.1016/j.future.2018.08.011"},{"issue":"1","_id":"63","intvolume":" 21","page":"77-92","year":"2018","citation":{"ieee":"E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.","mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018): 77–92. https://doi.org/10.1007/s10951-017-0518-0.","ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0"},"type":"journal_article","ddc":["040"],"user_id":"15415","volume":21,"date_created":"2017-10-17T12:41:03Z","has_accepted_license":"1","status":"public","publication":"Journal of Scheduling","file_date_updated":"2018-03-21T13:16:59Z","publisher":"Springer","author":[{"last_name":"Althaus","full_name":"Althaus, Ernst","first_name":"Ernst"},{"first_name":"Andre","full_name":"Brinkmann, Andre","last_name":"Brinkmann"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Nagel","full_name":"Nagel, Lars","first_name":"Lars"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"full_name":"Sgall, Jiri","first_name":"Jiri","last_name":"Sgall"},{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"}],"file":[{"access_level":"closed","file_name":"63-main_05.pdf","date_created":"2018-03-21T13:16:59Z","date_updated":"2018-03-21T13:16:59Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":466808,"file_id":"1577","creator":"florida"}],"doi":"10.1007/s10951-017-0518-0","date_updated":"2022-01-06T07:03:00Z","language":[{"iso":"eng"}],"title":"Scheduling Shared Continuous Resources on Many-Cores","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}]},{"file":[{"content_type":"application/pdf","date_updated":"2018-11-02T14:38:37Z","success":1,"relation":"main_file","file_size":500005,"file_id":"5277","creator":"ups","access_level":"closed","date_created":"2018-11-02T14:38:37Z","file_name":"ASelf-stabilizingHashedPatrici.pdf"}],"author":[{"last_name":"Knollmann","id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"Springer, Cham","file_date_updated":"2018-11-02T14:38:37Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"has_accepted_license":"1","status":"public","date_created":"2018-09-17T13:12:18Z","volume":11201,"abstract":[{"lang":"eng","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."}],"user_id":"39241","ddc":["000"],"type":"conference","year":"2018","citation":{"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 Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1","apa":"Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, 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.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1."},"_id":"4411","intvolume":" 11201","conference":{"end_date":"2018-11-07","start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","location":"Tokyo"},"department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"editor":[{"last_name":"Izumi","first_name":"Taisuke","full_name":"Izumi, Taisuke"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"}],"external_id":{"arxiv":["1809.04923"]},"title":"A Self-Stabilizing Hashed Patricia Trie","series_title":"Lecture Notes of Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:02Z","doi":"10.1007/978-3-030-03232-6_1"},{"user_id":"38705","ddc":["000"],"abstract":[{"text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n","lang":"eng"}],"date_created":"2018-10-02T07:06:05Z","status":"public","has_accepted_license":"1","file":[{"file_id":"6621","creator":"ups","file_size":349034,"relation":"main_file","success":1,"date_updated":"2019-01-11T10:32:38Z","content_type":"application/pdf","date_created":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf","access_level":"closed"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"file_date_updated":"2019-01-11T10:32:38Z","publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","author":[{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"full_name":"Kolb, Christina","first_name":"Christina","id":"43647","last_name":"Kolb"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Sundermeier, Jannik","first_name":"Jannik","id":"38705","last_name":"Sundermeier"}],"publisher":"Springer","conference":{"location":"Helsinki","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","start_date":"2018-08-23","end_date":"2018-08-24"},"_id":"4563","citation":{"short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }"},"type":"conference","year":"2018","title":"Competitive Routing in Hybrid Communication Networks","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"date_updated":"2022-01-06T07:01:11Z","language":[{"iso":"eng"}]},{"ddc":["000"],"user_id":"38705","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T13:48:10Z","publisher":"ACM Press","author":[{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"file":[{"access_level":"closed","file_name":"p231-jung-1.pdf","date_created":"2018-11-02T13:48:10Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-02T13:48:10Z","file_id":"5254","creator":"ups","file_size":1025077}],"date_created":"2018-10-02T07:34:47Z","status":"public","has_accepted_license":"1","conference":{"location":"Wien","name":"SPAA'18","start_date":"2018-07-17","end_date":"2018-07-18"},"_id":"4565","citation":{"mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018."},"year":"2018","type":"conference","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","department":[{"_id":"63"},{"_id":"79"}],"publication_status":"published","publication_identifier":{"isbn":["9781450357999"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_updated":"2022-01-06T07:01:12Z","doi":"10.1145/3210377.3210663","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210662","date_updated":"2022-01-06T07:03:40Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_status":"published","publication_identifier":{"isbn":["9781450357999"]},"department":[{"_id":"63"}],"title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","type":"conference","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }","mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.","apa":"Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, 2018.","short":"F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018."},"year":"2018","_id":"7570","conference":{"end_date":"2018-07-18","start_date":"2018-07-16","name":"30th Symposium on Parallelism in Algorithms and Architectures","location":"Vienna"},"status":"public","has_accepted_license":"1","date_created":"2019-02-06T14:16:19Z","file":[{"file_id":"7576","creator":"jschaef","file_size":1504739,"relation":"main_file","date_updated":"2019-02-06T14:18:35Z","content_type":"application/pdf","file_name":"p359-meyer-auf-der-heide.pdf","date_created":"2019-02-06T14:18:35Z","access_level":"closed"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"id":"30291","last_name":"Schaefer","full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian"}],"publisher":"ACM Press","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","file_date_updated":"2019-02-06T14:18:35Z","user_id":"30291","ddc":["000"]},{"year":"2018","type":"conference","citation":{"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.","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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.","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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4","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: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.","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={10.1007/978-3-030-19759-9_4}, 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} }"},"_id":"4375","conference":{"location":"Helsinki","start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","end_date":"2018-08-21"},"file":[{"date_created":"2018-11-27T10:03:33Z","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","access_level":"closed","file_id":"5863","creator":"tillk","file_size":1122875,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-27T10:03:33Z"}],"author":[{"last_name":"Benter","first_name":"Markus","full_name":"Benter, Markus"},{"last_name":"Knollmann","id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"file_date_updated":"2018-11-27T10:03:33Z","status":"public","has_accepted_license":"1","date_created":"2018-09-11T05:26:59Z","abstract":[{"lang":"eng","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."}],"user_id":"14955","ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:00Z","doi":"10.1007/978-3-030-19759-9_4","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension"},{"author":[{"last_name":"Geromel","first_name":"Marcel","full_name":"Geromel, Marcel"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"status":"public","date_created":"2018-11-07T09:20:59Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"user_id":"477","title":"Mobile Facility Leasing","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","mla":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","ama":"Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.","apa":"Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.","chicago":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","ieee":"M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018."},"year":"2018","type":"bachelorsthesis","date_updated":"2022-01-06T07:01:51Z","_id":"5403"},{"date_updated":"2022-01-06T07:01:51Z","_id":"5404","year":"2018","type":"bachelorsthesis","citation":{"apa":"Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.","ama":"Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018.","chicago":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","mla":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","ieee":"P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018."},"language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"title":"Online Algorithmen für das k-Page Migration Problem","user_id":"477","date_created":"2018-11-07T09:23:17Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Patrick Irenäus","full_name":"Kolpaczki, Patrick Irenäus","last_name":"Kolpaczki"}],"publisher":"Universität Paderborn"},{"year":"2018","citation":{"short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }"},"type":"journal_article","page":"1145-1167","issue":"4","_id":"669","intvolume":" 36","volume":36,"has_accepted_license":"1","status":"public","date_created":"2017-10-26T14:11:04Z","publisher":"Springer Nature","author":[{"last_name":"Feldotto","id":"14052","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"first_name":"Lennart","full_name":"Leder, Lennart","last_name":"Leder"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"file_date_updated":"2018-10-31T16:57:32Z","publication":"Journal of Combinatorial Optimization","file":[{"creator":"feldi","file_id":"5226","file_size":605207,"success":1,"relation":"main_file","date_updated":"2018-10-31T16:57:32Z","content_type":"application/pdf","date_created":"2018-10-31T16:57:32Z","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","access_level":"closed"}],"ddc":["000"],"user_id":"14052","abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"language":[{"iso":"eng"}],"doi":"10.1007/s10878-017-0189-y","date_updated":"2022-01-06T07:03:15Z","publication_identifier":{"issn":["1382-6905","1573-2886"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Congestion games with mixed objectives","external_id":{"arxiv":["1607.05143"]}},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-03-02T13:47:57Z","publisher":"Universität Paderborn","author":[{"first_name":"Arne","full_name":"Kemper, Arne","last_name":"Kemper"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","user_id":"14052","year":"2018","citation":{"ieee":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","bibtex":"@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }","mla":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","chicago":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","apa":"Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.","ama":"Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn; 2018."},"type":"mastersthesis","supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"_id":"1186","date_updated":"2022-01-06T06:51:11Z"},{"department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"full_name":"Nachtigall, Marcel","first_name":"Marcel","last_name":"Nachtigall"}],"date_created":"2018-03-02T13:49:39Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","user_id":"14052","title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"citation":{"mla":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.","bibtex":"@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall, Marcel}, year={2018} }","chicago":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.","apa":"Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.","ama":"Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn; 2018.","ieee":"M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018."},"year":"2018","type":"bachelorsthesis","date_updated":"2022-01-06T06:51:11Z","_id":"1187"}]