--- _id: '33947' article_type: original author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031 apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291. https://doi.org/10.1016/j.tcs.2022.10.031 bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }' chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science 939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.' ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291, 2023, doi: 10.1016/j.tcs.2022.10.031.' mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031. short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291. date_created: 2022-10-28T05:11:16Z date_updated: 2023-01-30T09:20:09Z department: - _id: '63' doi: 10.1016/j.tcs.2022.10.031 external_id: arxiv: - '2010.04424 ' intvolume: ' 939' keyword: - General Computer Science - Theoretical Computer Science language: - iso: eng page: 261-291 project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier BV status: public title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation type: journal_article user_id: '38705' volume: 939 year: '2023' ... --- _id: '34008' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) . Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15' apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15 bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.' ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253, p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.' mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15. short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.' conference: end_date: 2022-12-15 location: Brussels name: 26th International Conference on Principles of Distributed Systems (OPODIS) start_date: 2022-12-13 date_created: 2022-11-04T09:41:30Z date_updated: 2023-02-15T14:53:12Z department: - _id: '63' doi: 10.4230/LIPIcs.OPODIS.2022.15 editor: - first_name: Eshcar full_name: Hillel, Eshcar last_name: Hillel - first_name: Roberto full_name: Palmieri, Roberto last_name: Palmieri - first_name: Etienne full_name: Riviére, Etienne last_name: Riviére external_id: arxiv: - '2206.07567 ' intvolume: ' 253' language: - iso: eng page: 15:1–15:25 place: Brussels project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: 'Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ' publication_identifier: isbn: - 978-3-95977-265-5 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ' type: conference user_id: '38705' volume: 253 year: '2023' ... --- _id: '44077' author: - first_name: Marten full_name: Maack, Marten last_name: Maack citation: ama: Maack M. Online load balancing on uniform machines with limited migration. Operations Research Letters. 2023;51(3):220-225. doi:10.1016/j.orl.2023.02.013 apa: Maack, M. (2023). Online load balancing on uniform machines with limited migration. Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013 bibtex: '@article{Maack_2023, title={Online load balancing on uniform machines with limited migration}, volume={51}, DOI={10.1016/j.orl.2023.02.013}, number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack, Marten}, year={2023}, pages={220–225} }' chicago: 'Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters 51, no. 3 (2023): 220–25. https://doi.org/10.1016/j.orl.2023.02.013.' ieee: 'M. Maack, “Online load balancing on uniform machines with limited migration,” Operations Research Letters, vol. 51, no. 3, pp. 220–225, 2023, doi: 10.1016/j.orl.2023.02.013.' mla: Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:10.1016/j.orl.2023.02.013. short: M. Maack, Operations Research Letters 51 (2023) 220–225. date_created: 2023-04-20T08:59:14Z date_updated: 2023-04-21T07:53:42Z department: - _id: '63' doi: 10.1016/j.orl.2023.02.013 intvolume: ' 51' issue: '3' keyword: - Applied Mathematics - Industrial and Manufacturing Engineering - Management Science and Operations Research - Software language: - iso: eng page: 220-225 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' name: 'SFB 901 - C4: SFB 901 - Subproject C4' publication: Operations Research Letters publication_identifier: issn: - 0167-6377 publisher: Elsevier BV status: public title: Online load balancing on uniform machines with limited migration type: journal_article user_id: '88252' volume: 51 year: '2023' ... --- _id: '44769' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1' apa: Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1 bibtex: '@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }' chicago: 'Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.' ieee: 'J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham: Springer International Publishing, 2023.' mla: Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” Lecture Notes in Computer Science, Springer International Publishing, 2023, doi:10.1007/978-3-031-30448-4_1. short: 'J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.' date_created: 2023-05-11T13:13:45Z date_updated: 2023-05-11T13:14:43Z department: - _id: '63' doi: 10.1007/978-3-031-30448-4_1 language: - iso: eng place: Cham project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783031304477' - '9783031304484' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Unifying Gathering Protocols for Swarms of Mobile Robots type: book_chapter user_id: '38705' year: '2023' ... --- _id: '45580' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow citation: ama: Castenow J. Local Protocols for Contracting and Expanding Robot Formation Problems.; 2023. doi:10.17619/UNIPB/1-1750 apa: Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems. https://doi.org/10.17619/UNIPB/1-1750 bibtex: '@book{Castenow_2023, title={Local Protocols for Contracting and Expanding Robot Formation Problems}, DOI={10.17619/UNIPB/1-1750}, author={Castenow, Jannik}, year={2023} }' chicago: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems, 2023. https://doi.org/10.17619/UNIPB/1-1750. ieee: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems. 2023. mla: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems. 2023, doi:10.17619/UNIPB/1-1750. short: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023. date_created: 2023-06-12T13:06:58Z date_updated: 2023-06-13T07:43:11Z department: - _id: '63' doi: 10.17619/UNIPB/1-1750 language: - iso: eng project: - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' grant_number: '160364472' name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)' - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local Protocols for Contracting and Expanding Robot Formation Problems type: dissertation user_id: '38705' year: '2023' ... --- _id: '45579' author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 citation: ama: Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.; 2023. doi:10.17619/UNIPB/1-1751 apa: Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources. https://doi.org/10.17619/UNIPB/1-1751 bibtex: '@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={10.17619/UNIPB/1-1751}, author={Knollmann, Till}, year={2023} }' chicago: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources, 2023. https://doi.org/10.17619/UNIPB/1-1751. ieee: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources. 2023. mla: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources. 2023, doi:10.17619/UNIPB/1-1751. short: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023. date_created: 2023-06-12T13:05:04Z date_updated: 2023-06-12T21:03:14Z department: - _id: '63' doi: 10.17619/UNIPB/1-1751 language: - iso: eng project: - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' grant_number: '160364472' name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)' - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Algorithms for Allocating Heterogeneous Resources type: dissertation user_id: '39241' year: '2023' ... --- _id: '45781' author: - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop citation: ama: Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.; 2023. doi:10.17619/UNIPB/1-1768 apa: Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. https://doi.org/10.17619/UNIPB/1-1768 bibtex: '@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={10.17619/UNIPB/1-1768 }, author={Pukrop, Simon}, year={2023} }' chicago: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768 . ieee: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023. mla: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023, doi:10.17619/UNIPB/1-1768 . short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023. date_created: 2023-06-27T05:24:19Z date_updated: 2023-07-14T09:27:44Z department: - _id: '63' doi: '10.17619/UNIPB/1-1768 ' language: - iso: eng project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' grant_number: '160364472' name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling type: dissertation user_id: '15504' year: '2023' ... --- _id: '50458' abstract: - lang: eng text: AbstractConsider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays. author: - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop citation: ama: Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. Algorithmica. Published online 2023. doi:10.1007/s00453-023-01189-x apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling. Algorithmica. https://doi.org/10.1007/s00453-023-01189-x bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={10.1007/s00453-023-01189-x}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }' chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” Algorithmica, 2023. https://doi.org/10.1007/s00453-023-01189-x. ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” Algorithmica, 2023, doi: 10.1007/s00453-023-01189-x.' mla: Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x. short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023). date_created: 2024-01-11T11:10:53Z date_updated: 2024-01-11T11:19:33Z department: - _id: '63' doi: 10.1007/s00453-023-01189-x extern: '1' keyword: - Applied Mathematics - Computer Science Applications - General Computer Science language: - iso: eng project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' grant_number: '160364472' name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)' publication: Algorithmica publication_identifier: issn: - 0178-4617 - 1432-0541 publication_status: published publisher: Springer Science and Business Media LLC status: public title: Server Cloud Scheduling type: journal_article user_id: '44428' year: '2023' ... --- _id: '50460' author: - first_name: Max A. full_name: Deppert, Max A. last_name: Deppert - first_name: Klaus full_name: Jansen, Klaus last_name: Jansen - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop - first_name: Malin full_name: Rau, Malin last_name: Rau citation: ama: 'Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared Resources. In: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2023. doi:10.1109/ipdps54959.2023.00049' apa: Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling with Many Shared Resources. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049 bibtex: '@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling with Many Shared Resources}, DOI={10.1109/ipdps54959.2023.00049}, booktitle={2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}, year={2023} }' chicago: Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau. “Scheduling with Many Shared Resources.” In 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2023. https://doi.org/10.1109/ipdps54959.2023.00049. ieee: 'M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with Many Shared Resources,” 2023, doi: 10.1109/ipdps54959.2023.00049.' mla: Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023, doi:10.1109/ipdps54959.2023.00049. short: 'M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.' date_created: 2024-01-11T11:30:14Z date_updated: 2024-01-11T11:31:11Z department: - _id: '63' doi: 10.1109/ipdps54959.2023.00049 language: - iso: eng project: - _id: '1' grant_number: '160364472' name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' grant_number: '160364472' name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)' publication: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS) publication_status: published publisher: IEEE status: public title: Scheduling with Many Shared Resources type: conference user_id: '44428' year: '2023' ... --- _id: '29843' article_number: '104877' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation. Published online 2022. doi:10.1016/j.ic.2022.104877 apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877. https://doi.org/10.1016/j.ic.2022.104877 bibtex: '@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={10.1016/j.ic.2022.104877}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }' chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2022.104877. ieee: 'J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation, Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.' mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 104877, Elsevier BV, 2022, doi:10.1016/j.ic.2022.104877. short: J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022). date_created: 2022-02-15T07:38:28Z date_updated: 2022-02-15T07:41:00Z department: - _id: '63' doi: 10.1016/j.ic.2022.104877 keyword: - Computational Theory and Mathematics - Computer Science Applications - Information Systems - Theoretical Computer Science language: - iso: eng project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published publisher: Elsevier BV status: public title: A Discrete and Continuous Study of the Max-Chain-Formation Problem type: journal_article user_id: '38705' year: '2022' ... --- _id: '31847' abstract: - lang: eng text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n \ \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2022:345-356. doi:10.1145/3490148.3538595' apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356. https://doi.org/10.1145/3490148.3538595 bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }' chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595. ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356, doi: 10.1145/3490148.3538595.' mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595. short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.' date_created: 2022-06-10T09:06:42Z date_updated: 2022-08-02T08:07:30Z department: - _id: '63' doi: 10.1145/3490148.3538595 external_id: arxiv: - '2205.11102' keyword: - K-Server Problem - Heterogeneity - Online Caching language: - iso: eng page: 345-356 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450391467' publisher: Association for Computing Machinery status: public title: The k-Server with Preferences Problem type: conference user_id: '39241' year: '2022' ... --- _id: '34040' abstract: - lang: eng text: "Consider the practical goal of making a desired action profile played,\r\n\r\nwhen the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications include motivating people\r\n\r\nto choose the closest school, the closest subway station, or to coordinate\r\n\r\non a communication protocol or an investment strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly. The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we also prove that our adjustment minimises \r\n\r\nthe general transfer among all such adjustments, counting the total subsidising and taxation." author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Marcin full_name: Dziubiński, Marcin last_name: Dziubiński citation: ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64' apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64 bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64}, booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt, Luc}, year={2022} }' chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64. ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,” in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.' mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64. short: 'G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022.' conference: end_date: 2022-07-29 location: Vienna name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE start_date: 2022-07-23 date_created: 2022-11-08T16:53:31Z date_updated: 2022-11-08T17:34:36Z department: - _id: '63' - _id: '541' doi: 10.24963/ijcai.2022/64 editor: - first_name: Luc full_name: De Raedt, Luc last_name: De Raedt keyword: - adjustment - strictly dominant - fairness - individually rational - transfer - tax - subsidy language: - iso: eng main_file_link: - url: https://www.ijcai.org/proceedings/2022/64 publication: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence publication_status: published publisher: International Joint Conferences on Artificial Intelligence Organization status: public title: Fair, Individually Rational and Cheap Adjustment type: conference user_id: '83983' year: '2022' ... --- _id: '33085' author: - first_name: Leah full_name: Epstein, Leah last_name: Epstein - first_name: Alexandra full_name: Lassota, Alexandra last_name: Lassota - first_name: Asaf full_name: Levin, Asaf last_name: Levin - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Lars full_name: Rohwedder, Lars last_name: Rohwedder citation: ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28' apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.28 bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }' chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28. ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.' mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28. short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.' date_created: 2022-08-23T08:10:36Z date_updated: 2022-11-08T16:34:32Z department: - _id: '63' doi: 10.4230/LIPIcs.STACS.2022.28 editor: - first_name: Petra full_name: Berenbrink, Petra last_name: Berenbrink - first_name: Benjamin full_name: Monmege, Benjamin last_name: Monmege intvolume: ' 219' language: - iso: eng page: 28:1–28:15 project: - _id: '16' name: 'SFB 901 - C4: SFB 901 - Subproject C4' - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' publication: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: Cardinality Constrained Scheduling in Online Models type: conference user_id: '88252' volume: 219 year: '2022' ... --- _id: '33491' author: - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop - first_name: Anna Rodriguez full_name: Rasmussen, Anna Rodriguez last_name: Rasmussen citation: ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77' apa: Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77 bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={10.4230/LIPIcs.ESA.2022.77}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }' chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.ESA.2022.77. ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, 2022, vol. 244, p. 77:1–77:13, doi: 10.4230/LIPIcs.ESA.2022.77.' mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77. short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.' date_created: 2022-09-27T13:06:05Z date_updated: 2022-11-18T10:14:14Z department: - _id: '63' doi: 10.4230/LIPIcs.ESA.2022.77 editor: - first_name: Shiri full_name: Chechik, Shiri last_name: Chechik - first_name: Gonzalo full_name: Navarro, Gonzalo last_name: Navarro - first_name: Eva full_name: Rotenberg, Eva last_name: Rotenberg - first_name: Grzegorz full_name: Herman, Grzegorz last_name: Herman intvolume: ' 244' language: - iso: eng page: 77:1–77:13 project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '16' name: 'SFB 901 - C4: SFB 901 - Subproject C4' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling type: conference user_id: '477' volume: 244 year: '2022' ... --- _id: '31479' author: - first_name: Surender full_name: Baswana, Surender last_name: Baswana - first_name: Shiv full_name: Gupta, Shiv last_name: Gupta - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 citation: ama: Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica. Published online 2022. doi:10.1007/s00453-022-00978-0 apa: Baswana, S., Gupta, S., & Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica. https://doi.org/10.1007/s00453-022-00978-0 bibtex: '@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={10.1007/s00453-022-00978-0}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }' chicago: Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” Algorithmica, 2022. https://doi.org/10.1007/s00453-022-00978-0. ieee: 'S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.' mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” Algorithmica, Springer Science and Business Media LLC, 2022, doi:10.1007/s00453-022-00978-0. short: S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022). date_created: 2022-05-27T10:09:24Z date_updated: 2022-05-27T10:14:27Z department: - _id: '63' doi: 10.1007/s00453-022-00978-0 genbank: - tillk keyword: - Applied Mathematics - Computer Science Applications - General Computer Science language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' publication: Algorithmica publication_identifier: issn: - 0178-4617 - 1432-0541 publication_status: published publisher: Springer Science and Business Media LLC status: public title: Mincut Sensitivity Data Structures for the Insertion of an Edge type: journal_article user_id: '39241' year: '2022' ... --- _id: '29872' author: - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop citation: ama: 'Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: Approximation and Online Algorithms. Springer International Publishing; 2022. doi:10.1007/978-3-030-92702-8_10' apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2022). Server Cloud Scheduling. In Approximation and Online Algorithms. Springer International Publishing. https://doi.org/10.1007/978-3-030-92702-8_10 bibtex: '@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={10.1007/978-3-030-92702-8_10}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }' chicago: 'Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-030-92702-8_10.' ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in Approximation and Online Algorithms, Cham: Springer International Publishing, 2022.' mla: Maack, Marten, et al. “Server Cloud Scheduling.” Approximation and Online Algorithms, Springer International Publishing, 2022, doi:10.1007/978-3-030-92702-8_10. short: 'M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.' date_created: 2022-02-18T09:31:54Z date_updated: 2022-09-27T15:03:13Z department: - _id: '63' doi: 10.1007/978-3-030-92702-8_10 language: - iso: eng place: Cham project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '4' name: 'SFB 901 - C: SFB 901 - Project Area C' - _id: '16' name: 'SFB 901 - C4: SFB 901 - Subproject C4' publication: Approximation and Online Algorithms publication_identifier: isbn: - '9783030927011' - '9783030927028' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Server Cloud Scheduling type: book_chapter user_id: '44428' year: '2022' ... --- _id: '21096' abstract: - lang: eng text: While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys. article_number: '104697' author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697 apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697 bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697. ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.' mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697. short: T. Knollmann, C. Scheideler, Information and Computation (2022). date_created: 2021-01-29T09:39:40Z date_updated: 2023-03-27T07:56:48Z department: - _id: '63' - _id: '79' doi: 10.1016/j.ic.2021.104697 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: A self-stabilizing Hashed Patricia Trie type: journal_article user_id: '15504' year: '2022' ... --- _id: '23730' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R, Radzik T, eds. Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS. Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3' apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L. Gasieniec, R. Klasing, & T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) (Vol. 12961, pp. 29–44). Springer. https://doi.org/10.1007/978-3-030-89240-1_3 bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021, series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time}, volume={12961}, DOI={10.1007/978-3-030-89240-1_3}, booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz}, year={2021}, pages={29–44}, collection={LNCS} }' chicago: Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” In Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec, Ralf Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-89240-1_3. ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time,” in Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Lissabon, 2021, vol. 12961, pp. 29–44, doi: 10.1007/978-3-030-89240-1_3.' mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time.” Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3. short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2021, pp. 29–44.' conference: end_date: 2021-09-10 location: Lissabon name: 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) 2021 start_date: 2021-09-09 date_created: 2021-09-03T09:01:25Z date_updated: 2022-01-06T06:55:58Z department: - _id: '63' doi: 10.1007/978-3-030-89240-1_3 editor: - first_name: Leszek full_name: Gasieniec, Leszek last_name: Gasieniec - first_name: Ralf full_name: Klasing, Ralf last_name: Klasing - first_name: Tomasz full_name: Radzik, Tomasz last_name: Radzik external_id: arxiv: - '2010.04424' intvolume: ' 12961' language: - iso: eng page: 29 - 44 project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) publication_status: published publisher: Springer series_title: LNCS status: public title: Gathering a Euclidean Closed Chain of Robots in Linear Time type: conference user_id: '38705' volume: 12961 year: '2021' ... --- _id: '23779' abstract: - lang: ger text: "Produktentstehung (PE) bezieht sich auf den Prozess der Planung und Entwicklung eines Produkts sowie der damit verbundenen Dienstleistungen von der ersten Idee bis zur Herstellung und zum Vertrieb. Während dieses Prozesses gibt es zahlreiche Aufgaben, die von menschlichem Fachwissen abhängen und typischerweise von erfahrenen Experten übernommen werden. Da sich das Feld der Künstlichen Intelligenz (KI) immer weiterentwickelt und seinen Weg in den Fertigungssektor findet, gibt es viele Möglichkeiten für eine Anwendung von KI, um bei der Lösung der oben genannten Aufgaben zu helfen. In diesem Paper geben wir einen umfassenden Überblick über den aktuellen Stand der Technik des Einsatzes von KI in der PE. \r\nIm Detail analysieren wir 40 bestehende Surveys zu KI in der PE und 94 Case Studies, um herauszufinden, welche Bereiche der PE von der aktuellen Forschung in diesem Bereich vorrangig adressiert werden, wie ausgereift die diskutierten KI-Methoden sind und inwieweit datenzentrierte Ansätze in der aktuellen Forschung genutzt werden." - lang: eng text: "Product Creation (PC) refers to the process of planning and developing a product as well as related services from the initial idea until manufacturing and distribution. Throughout this process, there are numerous tasks that depend on human expertise and are typically undertaken by experienced practitioners. As the field of Artificial Intelligence (AI) continues to evolve and finds its way into the manufacturing sector, there exist many possibilities for an application of AI in order to assist in solving aforementioned tasks. In this work, we provide a comprehensive overview of the current state of the art of the use of AI in PC. \r\nIn detail, we analyze 40 existing surveys on AI in PC and 94 case studies in order to find out which areas of PC are primarily addressed by current research in this field, how mature the discussed AI methods are, and to which extent data-centric approaches are utilized in current research." author: - first_name: Ruslan full_name: Bernijazov, Ruslan last_name: Bernijazov - first_name: Alexander full_name: Dicks, Alexander last_name: Dicks - first_name: Roman full_name: Dumitrescu, Roman id: '16190' last_name: Dumitrescu - first_name: Marc full_name: Foullois, Marc last_name: Foullois - first_name: Jonas Manuel full_name: Hanselle, Jonas Manuel id: '43980' last_name: Hanselle orcid: 0000-0002-1231-4985 - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Gökce full_name: Karakaya, Gökce last_name: Karakaya - first_name: Patrick full_name: Ködding, Patrick id: '45402' last_name: Ködding - first_name: Volker full_name: Lohweg, Volker last_name: Lohweg - first_name: Manuel full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Melina full_name: Panzner, Melina last_name: Panzner - first_name: Christian full_name: Soltenborn, Christian id: '1737' last_name: Soltenborn orcid: 0000-0002-0342-8227 citation: ama: 'Bernijazov R, Dicks A, Dumitrescu R, et al. A Meta-Review on Artificial Intelligence in Product Creation. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). ; 2021.' apa: Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier, E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide, F., Panzner, M., & Soltenborn, C. (2021). A Meta-Review on Artificial Intelligence in Product Creation. Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21). 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada. bibtex: '@inproceedings{Bernijazov_Dicks_Dumitrescu_Foullois_Hanselle_Hüllermeier_Karakaya_Ködding_Lohweg_Malatyali_et al._2021, title={A Meta-Review on Artificial Intelligence in Product Creation}, booktitle={Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21)}, author={Bernijazov, Ruslan and Dicks, Alexander and Dumitrescu, Roman and Foullois, Marc and Hanselle, Jonas Manuel and Hüllermeier, Eyke and Karakaya, Gökce and Ködding, Patrick and Lohweg, Volker and Malatyali, Manuel and et al.}, year={2021} }' chicago: Bernijazov, Ruslan, Alexander Dicks, Roman Dumitrescu, Marc Foullois, Jonas Manuel Hanselle, Eyke Hüllermeier, Gökce Karakaya, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021. ieee: R. Bernijazov et al., “A Meta-Review on Artificial Intelligence in Product Creation,” presented at the 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada, 2021. mla: Bernijazov, Ruslan, et al. “A Meta-Review on Artificial Intelligence in Product Creation.” Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021. short: 'R. Bernijazov, A. Dicks, R. Dumitrescu, M. Foullois, J.M. Hanselle, E. Hüllermeier, G. Karakaya, P. Ködding, V. Lohweg, M. Malatyali, F. Meyer auf der Heide, M. Panzner, C. Soltenborn, in: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21), 2021.' conference: end_date: 2021-08-26 location: Montreal, Kanada name: 30th International Joint Conference on Artificial Intelligence (IJCAI 2021) - Workshop "AI and Product Design" start_date: 2021-08-19 date_created: 2021-09-06T08:23:45Z date_updated: 2022-01-06T06:55:59Z department: - _id: '63' - _id: '563' - _id: '355' - _id: '241' keyword: - Artificial Intelligence Product Creation Literature Review language: - iso: eng main_file_link: - url: https://www.hsu-hh.de/imb/wp-content/uploads/sites/677/2021/08/A-Meta-Review-on-Artificial-Intelligence-in-Product-Creation.pdf publication: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-21) publication_status: epub_ahead quality_controlled: '1' status: public title: A Meta-Review on Artificial Intelligence in Product Creation type: conference user_id: '15415' year: '2021' ... --- _id: '20683' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8 apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984. https://doi.org/10.1007/s00224-020-10023-8 bibtex: '@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={10.1007/s00224-020-10023-8}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }' chicago: 'Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” Theory of Computing Systems 65 (2021): 943–984. https://doi.org/10.1007/s00224-020-10023-8.' ieee: 'B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi: 10.1007/s00224-020-10023-8.' mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8. short: B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984. date_created: 2020-12-08T08:40:10Z date_updated: 2022-01-06T06:54:31Z department: - _id: '63' doi: 10.1007/s00224-020-10023-8 intvolume: ' 65' language: - iso: eng page: 943–984 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Theory of Computing Systems publication_status: published status: public title: Managing Multiple Mobile Resources type: journal_article user_id: '15415' volume: 65 year: '2021' ... --- _id: '20817' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Pawel full_name: Schmidt, Pawel last_name: Schmidt citation: ama: 'Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14' apa: Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17). https://doi.org/10.4230/LIPIcs.STACS.2021.14 bibtex: '@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={10.4230/LIPIcs.STACS.2021.14}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }' chicago: Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 14:1-14:17, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.14. ieee: M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17. mla: Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14. short: 'M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.' date_created: 2020-12-21T13:46:16Z date_updated: 2022-01-06T06:54:40Z department: - _id: '63' doi: 10.4230/LIPIcs.STACS.2021.14 language: - iso: eng page: 14:1 - 14:17 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) publication_status: published status: public title: A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location type: conference user_id: '22704' year: '2021' ... --- _id: '22510' abstract: - lang: eng text: 'Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art.' author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. Theoretical Computer Science. 2021;852:41-60. doi:10.1016/j.tcs.2020.10.037 apa: Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037 bibtex: '@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={10.1016/j.tcs.2020.10.037}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }' chicago: 'Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” Theoretical Computer Science 852 (2021): 41–60. https://doi.org/10.1016/j.tcs.2020.10.037.' ieee: S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” Theoretical Computer Science, vol. 852, pp. 41–60, 2021. mla: Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037. short: S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60. date_created: 2021-06-28T09:24:15Z date_updated: 2022-01-06T06:55:35Z department: - _id: '63' doi: 10.1016/j.tcs.2020.10.037 intvolume: ' 852' keyword: - Local algorithms - Distributed algorithms - Collisionless gathering - Mobile robots - Multiagent system language: - iso: eng page: 41-60 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: A continuous strategy for collisionless gathering type: journal_article user_id: '15415' volume: 852 year: '2021' ... --- _id: '22511' abstract: - lang: eng text: "In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n" author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science. 2021;852:29-40. doi:10.1016/j.tcs.2020.11.009 apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009 bibtex: '@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={10.1016/j.tcs.2020.11.009}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }' chicago: 'Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science 852 (2021): 29–40. https://doi.org/10.1016/j.tcs.2020.11.009.' ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” Theoretical Computer Science, vol. 852, pp. 29–40, 2021. mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009. short: S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40. date_created: 2021-06-28T09:34:45Z date_updated: 2022-01-06T06:55:35Z department: - _id: '63' doi: 10.1016/j.tcs.2020.11.009 intvolume: ' 852' keyword: - Local algorithms - Distributed algorithms - Collisionless gathering - Mobile robots - Multiagent system language: - iso: eng page: 29-40 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots type: journal_article user_id: '15415' volume: 852 year: '2021' ... --- _id: '26986' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Götte T, Knollmann T, Meyer auf der Heide F. The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller EM, Schmid S, eds. Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021. Vol 13046. LNCS. Springer; 2021:289-304. doi:10.1007/978-3-030-91081-5_19' apa: Castenow, J., Götte, T., Knollmann, T., & Meyer auf der Heide, F. (2021). The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation. In C. Johnen, E. M. Schiller, & S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer. https://doi.org/10.1007/978-3-030-91081-5_19 bibtex: '@inproceedings{Castenow_Götte_Knollmann_Meyer auf der Heide_2021, series={LNCS}, title={The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation}, volume={13046}, DOI={10.1007/978-3-030-91081-5_19}, booktitle={Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021}, publisher={Springer}, author={Castenow, Jannik and Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Johnen, C. and Schiller, E.M. and Schmid, S.}, year={2021}, pages={289–304}, collection={LNCS} }' chicago: Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” In Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen, E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5_19. ieee: 'J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation,” in Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Online, 2021, vol. 13046, pp. 289–304, doi: 10.1007/978-3-030-91081-5_19.' mla: Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.” Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19. short: 'J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen, E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer, 2021, pp. 289–304.' conference: end_date: 2021-11-20 location: Online name: 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems start_date: 2021-11-17 date_created: 2021-10-28T07:01:30Z date_updated: 2022-01-07T15:24:10Z department: - _id: '63' doi: 10.1007/978-3-030-91081-5_19 editor: - first_name: C. full_name: Johnen, C. last_name: Johnen - first_name: E.M. full_name: Schiller, E.M. last_name: Schiller - first_name: S. full_name: Schmid, S. last_name: Schmid external_id: arxiv: - '2109.11856' intvolume: ' 13046' language: - iso: eng page: '289-304 ' project: - _id: '106' name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme' publication: Proceedings of the 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2021 publication_status: published publisher: Springer series_title: LNCS status: public title: The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation type: conference user_id: '38705' volume: 13046 year: '2021' ... --- _id: '27778' abstract: - lang: eng text: "Consider a set of jobs connected to a directed acyclic task graph with a\r\nfixed source and sink. The edges of this graph model precedence constraints and\r\nthe jobs have to be scheduled with respect to those. We introduce the Server\r\nCloud Scheduling problem, in which the jobs have to be processed either on a\r\nsingle local machine or on one of many cloud machines. Both the source and the\r\nsink have to be scheduled on the local machine. For each job, processing times\r\nboth on the server and in the cloud are given. Furthermore, for each edge in\r\nthe task graph, a communication delay is included in the input and has to be\r\ntaken into account if one of the two jobs is scheduled on the server, the other\r\nin the cloud. The server can process jobs sequentially, whereas the cloud can\r\nserve as many as needed in parallel, but induces costs. We consider both\r\nmakespan and cost minimization. The main results are an FPTAS with respect for\r\nthe makespan objective for a fairly general case and strong hardness for the\r\ncase with unit processing times and delays." author: - first_name: Marten full_name: Maack, Marten id: '88252' last_name: Maack - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop citation: ama: Maack M, Meyer auf der Heide F, Pukrop S. Full Version -- Server Cloud Scheduling. arXiv:210802109. Published online 2021. apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In arXiv:2108.02109. bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2021, title={Full Version -- Server Cloud Scheduling}, journal={arXiv:2108.02109}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2021} }' chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021. ieee: M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud Scheduling,” arXiv:2108.02109. 2021. mla: Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021. short: M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021). date_created: 2021-11-24T13:23:58Z date_updated: 2022-09-27T15:03:19Z department: - _id: '63' - _id: '26' language: - iso: eng publication: arXiv:2108.02109 status: public title: Full Version -- Server Cloud Scheduling type: preprint user_id: '44428' year: '2021' ... --- _id: '44234' author: - first_name: Thilo Frederik full_name: Berger, Thilo Frederik last_name: Berger citation: ama: Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021. apa: Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. bibtex: '@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021} }' chicago: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021. ieee: T. F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021. mla: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021. short: T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021. date_created: 2023-04-27T15:34:07Z date_updated: 2023-04-27T15:34:17Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation type: bachelorsthesis user_id: '39241' year: '2021' ... --- _id: '44233' author: - first_name: Sebastian full_name: Pranger, Sebastian last_name: Pranger citation: ama: Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021. apa: Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms. bibtex: '@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server Algorithms}, author={Pranger, Sebastian}, year={2021} }' chicago: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms, 2021. ieee: S. Pranger, Online k-Facility Reallocation using k-Server Algorithms. 2021. mla: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021. short: S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021. date_created: 2023-04-27T15:31:26Z date_updated: 2023-04-27T15:31:57Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: 'SFB 901: SFB 901' - _id: '2' name: 'SFB 901 - A: SFB 901 - Project Area A' - _id: '5' name: 'SFB 901 - A1: SFB 901 - Subproject A1' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online k-Facility Reallocation using k-Server Algorithms type: bachelorsthesis user_id: '39241' year: '2021' ... --- _id: '19899' abstract: - lang: eng text: "Most existing robot formation problems seek a target formation of a certain\r\nminimal and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation problem. In this work, we study formation problems that\r\ntry to reach a maximal structure, supporting for example an efficient\r\ncoverage in exploration scenarios. A recent example is the NASA Shapeshifter\r\nproject, which describes how the robots form a relay chain along which gathered\r\ndata from extraterrestrial cave explorations may be sent to a home base.\r\n As a first step towards understanding such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem, where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting chain and must form a connected,\r\nstraight line of maximal length connecting its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a continuous time model. In the\r\ndiscrete case, we give a complete analysis if all robots are initially\r\ncollinear, showing that the worst-case time to reach an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot \\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$. If one endpoint of the chain remains stationary, this result\r\ncan be extended to the non-collinear case. If both endpoints move, we identify\r\na family of instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect of the strategy: slowing down the endpoints while all\r\nother robots move at full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in the discrete model." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:10.1007/978-3-030-64348-5_6' apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes & N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80). Springer. https://doi.org/10.1007/978-3-030-64348-5_6 bibtex: '@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={10.1007/978-3-030-64348-5_6}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes , Stéphane and Mittal, Neeraj Editors}, year={2020}, pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }' chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_6. ieee: J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, 2020, vol. 12514, pp. 65–80. mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6. short: 'J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.' date_created: 2020-10-06T07:27:10Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1007/978-3-030-64348-5_6 editor: - first_name: 'Stéphane ' full_name: 'Devismes , Stéphane ' last_name: 'Devismes ' - first_name: 'Neeraj ' full_name: 'Mittal, Neeraj ' last_name: Mittal external_id: arxiv: - '2010.02043 ' intvolume: ' 12514' language: - iso: eng page: 65-80 publication: Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings publication_identifier: isbn: - 978-3-030-64347-8 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science (LNCS) status: public title: A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up type: conference user_id: '38705' volume: 12514 year: '2020' ... --- _id: '20159' abstract: - lang: eng text: "Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. \r\n1) Single source: Given any designated source vertex s, there exists a data structure of size \U0001D4AA(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is \U0001D4AA(|S|). \r\n2) All-pairs: There exists an \U0001D4AA(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is \U0001D4AA(k), where k is the number of pairs of vertices whose mincut increases. \r\nFor both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of \U0001D4AA(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of \U0001D4AA(n) size." author: - first_name: Surender full_name: Baswana, Surender last_name: Baswana - first_name: Shiv full_name: Gupta, Shiv last_name: Gupta - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 citation: ama: 'Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. 28th Annual European Symposium on Algorithms (ESA 2020). Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi:10.4230/LIPIcs.ESA.2020.12' apa: 'Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.12' bibtex: '@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={10.4230/LIPIcs.ESA.2020.12}, booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” In 28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.12.' ieee: S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in 28th Annual European Symposium on Algorithms (ESA 2020), 2020, vol. 173, pp. 12:1-12:14. mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” 28th Annual European Symposium on Algorithms (ESA 2020), edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12. short: 'S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.' date_created: 2020-10-21T12:00:20Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' doi: 10.4230/LIPIcs.ESA.2020.12 editor: - first_name: Fabrizio full_name: Grandoni, Fabrizio last_name: Grandoni - first_name: Grzegorz full_name: Herman, Grzegorz last_name: Herman - first_name: Peter full_name: Sanders, Peter last_name: Sanders intvolume: ' 173' keyword: - Mincut - Sensitivity - Data Structure language: - iso: eng page: 12:1-12:14 place: Dagstuhl, Germany publication: 28th Annual European Symposium on Algorithms (ESA 2020) publication_identifier: isbn: - 978-3-95977-162-7 issn: - 1868-8969 publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Mincut Sensitivity Data Structures for the Insertion of an Edge type: conference user_id: '39241' volume: 173 year: '2020' ... --- _id: '20185' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Jonas full_name: Harbig, Jonas id: '47213' last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5' apa: 'Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility . In S. Devismes & N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 60–64). Springer. https://doi.org/10.1007/978-3-030-64348-5_5' bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility }, volume={12514}, DOI={10.1007/978-3-030-64348-5_5}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane and Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }' chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” In Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_5.' ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.' mla: 'Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.' short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.' date_created: 2020-10-23T08:50:28Z date_updated: 2022-01-06T06:54:21Z department: - _id: '63' doi: 10.1007/978-3-030-64348-5_5 editor: - first_name: 'Stéphane ' full_name: 'Devismes, Stéphane ' last_name: Devismes - first_name: Neeraj full_name: ' Mittal, Neeraj' last_name: ' Mittal' external_id: arxiv: - '2010.04424 ' intvolume: ' 12514' language: - iso: eng page: 60-64 publication: 'Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ' publication_identifier: isbn: - 978-3-030-64347-8 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science (LNCS) status: public title: 'Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ' type: conference user_id: '38705' volume: 12514 year: '2020' ... --- _id: '17370' abstract: - lang: eng 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." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2020-07-14T07:53:20Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400281 external_id: arxiv: - '2005.08391' file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2020-07-14T07:56:52Z date_updated: 2020-07-14T07:56:52Z file_id: '17373' file_name: 3350755.3400281.pdf file_size: 1271416 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:52Z has_accepted_license: '1' keyword: - Online Multi-Commodity Facility Location - Competitive Ratio - Online Optimization - Facility Location Problem language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: The Online Multi-Commodity Facility Location Problem type: conference user_id: '39241' year: '2020' ... --- _id: '17371' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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} }' 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.' 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.' 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.' date_created: 2020-07-14T07:53:47Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400263 external_id: arxiv: - '2010.02043 ' file: - access_level: closed content_type: application/pdf creator: janniksu date_created: 2020-07-14T07:56:04Z date_updated: 2020-07-14T07:56:04Z file_id: '17372' file_name: 3350755.3400263.pdf file_size: 1078544 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:04Z has_accepted_license: '1' language: - iso: eng publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: 'Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up' type: conference user_id: '38705' year: '2020' ... --- _id: '16968' abstract: - lang: eng 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 text: Best Student Paper Award author: - first_name: Michael full_name: Braun, Michael last_name: Braun - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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} }' 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. 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. 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.' conference: end_date: 2020-07-01 location: Paderborn name: SIROCCO 2020 start_date: 2020-06-29 date_created: 2020-05-18T06:48:35Z date_updated: 2022-01-06T06:53:00Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-030-54921-3_4 external_id: arxiv: - arXiv:2005.07495 file: - access_level: closed content_type: application/pdf creator: janniksu date_created: 2020-07-31T08:22:16Z date_updated: 2020-07-31T08:22:16Z file_id: '17504' file_name: localGathering.pdf file_size: 505712 relation: main_file success: 1 file_date_updated: 2020-07-31T08:22:16Z has_accepted_license: '1' language: - iso: eng publication: Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO) publisher: Springer status: public title: Local Gathering of Mobile Robots in Three Dimensions type: conference user_id: '38705' year: '2020' ... --- _id: '15631' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord citation: 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 bibtex: '@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource Allocation}, DOI={10.17619/UNIPB/1-869}, author={Feldkord, Björn}, year={2020} }' 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. mla: Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869. short: B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020. date_created: 2020-01-23T14:20:25Z date_updated: 2022-01-06T06:52:31Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-869 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2020-01-24T08:19:38Z date_updated: 2020-01-24T08:19:38Z file_id: '15634' file_name: DissertationFeldkord.pdf file_size: 633652 relation: main_file success: 1 file_date_updated: 2020-01-24T08:19:38Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Mobile Resource Allocation type: dissertation user_id: '15415' year: '2020' ... --- _id: '15025' abstract: - lang: eng 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. author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Lorijn full_name: van Rooijen, Lorijn id: '58843' last_name: van Rooijen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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 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 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} }' 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.' 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.' 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. short: M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020) 165–193. date_created: 2019-11-18T14:19:19Z date_updated: 2022-01-06T06:52:15Z department: - _id: '34' - _id: '355' - _id: '26' - _id: '63' - _id: '238' doi: 10.1162/evco_a_00266 intvolume: ' 28' issue: '2' language: - iso: eng page: 165–193 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Evolutionary Computation publication_status: published publisher: MIT Press Journals related_material: link: - relation: confirmation url: https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266 status: public title: Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly Markets type: journal_article user_id: '15415' volume: 28 year: '2020' ... --- _id: '15169' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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.' 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} }' 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. 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. 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. short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.' conference: end_date: 07.01.2020 location: Kolkata, Indien name: '21st International Conference on Distributed Computing and Networking ' start_date: 04.01.2020 date_created: 2019-11-25T12:18:41Z date_updated: 2022-01-06T06:52:16Z department: - _id: '63' - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN) publication_status: accepted publisher: ACM status: public title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks type: conference user_id: '477' year: '2020' ... --- _id: '16299' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jonas full_name: Harbig, Jonas last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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} }' 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.' 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. 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. short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309. date_created: 2020-03-13T12:55:53Z date_updated: 2022-01-06T06:52:48Z department: - _id: '63' doi: 10.1016/j.tcs.2020.02.018 intvolume: ' 815' language: - iso: eng page: 289-309 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: journal_article user_id: '38705' volume: 815 year: '2020' ... --- _id: '13868' author: - first_name: Simon full_name: Pukrop, Simon id: '44428' last_name: Pukrop - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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.' 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). 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} }' 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. 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. 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. 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.' date_created: 2019-10-15T12:19:49Z date_updated: 2022-01-06T06:51:45Z department: - _id: '63' language: - iso: eng project: - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subproject C4 publication: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) status: public title: Approximating Weighted Completion Time for Order Scheduling with Setup Times type: conference user_id: '44428' year: '2020' ... --- _id: '13770' author: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: 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' 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} }' 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.' 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.' 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.' short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481. date_created: 2019-10-10T13:41:06Z date_updated: 2022-12-02T09:27:17Z ddc: - '004' department: - _id: '276' - _id: '75' - _id: '63' - _id: '77' doi: 10.1007/s12599-019-00627-x file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-12-12T10:24:47Z date_updated: 2019-12-12T10:24:47Z file_id: '15311' file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf file_size: 454532 relation: main_file success: 1 file_date_updated: 2019-12-12T10:24:47Z has_accepted_license: '1' intvolume: ' 62' issue: '6' language: - iso: eng page: 467-481 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '3' name: SFB 901 - Project Area B - _id: '4' name: SFB 901 - Project Area C - _id: '82' name: SFB 901 - Project Area T - _id: '5' name: SFB 901 - Subproject A1 - _id: '6' name: SFB 901 - Subproject A2 - _id: '7' name: SFB 901 - Subproject A3 - _id: '8' name: SFB 901 - Subproject A4 - _id: '9' name: SFB 901 - Subproject B1 - _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 - _id: '15' name: SFB 901 - Subproject C3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '17' name: SFB 901 - Subproject C5 - _id: '83' name: SFB 901 -Subproject T1 - _id: '84' name: SFB 901 -Subproject T2 - _id: '107' name: SFB 901 -Subproject T3 - _id: '158' name: 'SFB 901 - T4: SFB 901 -Subproject T4' publication: Business & Information Systems Engineering publication_status: published publisher: Springer status: public title: 'A Case for a New IT Ecosystem: On-The-Fly Computing' type: journal_article user_id: '477' volume: 62 year: '2020' ... --- _id: '17432' author: - first_name: Surender full_name: Baswana, Surender last_name: Baswana - first_name: Shiv full_name: Gupta, Shiv last_name: Gupta - first_name: Ayush full_name: Tulsyan, Ayush last_name: Tulsyan 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' 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)} }' 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.' 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.' 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.' date_created: 2020-07-29T07:33:56Z date_updated: 2022-01-06T06:53:12Z department: - _id: '63' doi: 10.4230/LIPICS.MFCS.2019.65 language: - iso: eng page: 65:1--65:16 publication: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: 'Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient' type: conference user_id: '15415' year: '2019' ... --- _id: '17667' 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.' author: - first_name: Ralph full_name: Koning, Ralph last_name: Koning - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Lydia full_name: Meijer, Lydia last_name: Meijer - first_name: Cees full_name: de Laat, Cees last_name: de Laat - first_name: Paola full_name: Grosso, Paola last_name: Grosso citation: 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' 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 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)} }' 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. 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. 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. 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.' 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) date_created: 2020-08-06T15:23:23Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1109/CSCloud/EdgeCom.2019.000-9 extern: '1' 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 language: - iso: eng main_file_link: - url: https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors page: 113-123 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) publication_identifier: issn: - 'null' quality_controlled: '1' 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) status: public title: Approaches for Collaborative Security Defences in Multi Network Environments type: conference user_id: '83983' year: '2019' ... --- _id: '18975' author: - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali citation: 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} }' chicago: 'Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-766.' ieee: 'M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams. Universität Paderborn, 2019.' mla: 'Malatyali, Manuel. Big Data: Sublinear Algorithms for Distributed Data Streams. 2019, doi:10.17619/UNIPB/1-766.' short: 'M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams, Universität Paderborn, 2019.' date_created: 2020-09-04T07:39:47Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' doi: 10.17619/UNIPB/1-766 language: - iso: eng place: Universität Paderborn related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-766 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: 'Big Data: Sublinear Algorithms for Distributed Data Streams' type: dissertation user_id: '15415' year: '2019' ... --- _id: '8080' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 citation: 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} }' 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. ieee: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. Universität Paderborn, 2019. mla: Feldotto, Matthias. Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games. 2019, doi:10.17619/UNIPB/1-588. short: M. Feldotto, Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games, Universität Paderborn, 2019. date_created: 2019-02-25T13:03:02Z date_updated: 2022-01-06T07:03:50Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.17619/UNIPB/1-588 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-03-28T13:40:51Z date_updated: 2019-03-28T13:40:51Z file_id: '8715' file_name: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games.pdf file_size: 3116177 relation: main_file success: 1 file_date_updated: 2019-03-28T13:40:51Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: http://digital.ub.uni-paderborn.de/hs/download/pdf/3005508?originalFilename=true place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Approximate Pure Nash Equilibria in Congestion, Opinion Formation and Facility Location Games type: dissertation user_id: '15415' year: '2019' ... --- _id: '8866' author: - first_name: Klaus full_name: Jansen, Klaus last_name: Jansen - first_name: Marten full_name: Maack, Marten last_name: Maack - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker citation: 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.' 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. 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. 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. 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. 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.' date_created: 2019-04-09T11:28:46Z date_updated: 2022-01-06T07:04:04Z department: - _id: '63' language: - iso: eng page: 145 - 154 project: - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '1' name: SFB 901 publication: Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Scheduling on (Un-)Related Machines with Setup Times type: conference user_id: '13536' year: '2019' ... --- _id: '5471' abstract: - lang: eng 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." author: - first_name: Philip full_name: Lazos, Philip last_name: Lazos - first_name: Paul full_name: Goldberg, Paul last_name: Goldberg - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik - first_name: Matthias full_name: Gerstgrasser, Matthias last_name: Gerstgrasser - first_name: Bart full_name: de Keijzer, Bart last_name: de Keijzer citation: 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 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} }' 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. 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.' 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. 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.' conference: end_date: 2019-02-01 location: Honolulu, Hawaii, USA name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) start_date: 2019-01-27 date_created: 2018-11-12T09:38:16Z date_updated: 2022-01-06T07:01:55Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.1609/aaai.v33i01.33011973 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-12-06T13:57:51Z date_updated: 2018-12-06T13:57:51Z file_id: '6018' file_name: 1811.05130.pdf file_size: 315877 relation: main_file success: 1 file_date_updated: 2018-12-06T13:57:51Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI) publication_status: published status: public title: ' Multi-unit Bilateral Trade' type: conference user_id: '15415' year: '2019' ... --- _id: '12870' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2019-07-22T09:00:05Z date_updated: 2022-01-06T06:51:20Z department: - _id: '63' doi: 10.1007/978-3-030-39479-0_9 external_id: arxiv: - '1907.09834' language: - iso: eng page: 120 - 137 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) publication_status: published publisher: Springer status: public title: Managing Multiple Mobile Resources type: conference user_id: '22704' year: '2019' ... --- _id: '14851' author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker citation: 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 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} }' 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. mla: Mäcker, Alexander. On Scheduling with Setup Times. 2019, doi:10.17619/UNIPB/1-828. short: A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019. date_created: 2019-11-07T14:17:05Z date_updated: 2022-01-06T06:52:08Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-828 language: - iso: eng place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subproject C4 - _id: '4' name: SFB 901 - Project Area C related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-828 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: On Scheduling with Setup Times type: dissertation user_id: '15415' year: '2019' ... --- _id: '16341' abstract: - lang: eng 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." author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: 0000-0003-3546-203X - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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. 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. 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. 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. mla: Brandt, Sascha, et al. “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). date_created: 2020-03-24T08:59:44Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' external_id: arxiv: - '1904.08225' language: - iso: eng main_file_link: - open_access: '1' oa: '1' publication: arXiv:1904.08225 status: public title: Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels type: preprint user_id: '15415' year: '2019' ... --- _id: '13873' article_number: '14' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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} }' 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. ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 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. short: B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019). date_created: 2019-10-16T07:06:22Z date_updated: 2022-01-06T06:51:46Z ddc: - '000' department: - _id: '63' doi: 10.1145/3364204 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2020-01-24T08:12:58Z date_updated: 2020-01-24T08:12:58Z file_id: '15632' file_name: DissertationFeldkord.pdf file_size: 633652 relation: main_file success: 1 file_date_updated: 2020-01-24T08:12:58Z has_accepted_license: '1' intvolume: ' 6' issue: '3' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: ACM Transactions on Parallel Computing (TOPC) publication_status: published status: public title: The Mobile Server Problem type: journal_article user_id: '15504' volume: 6 year: '2019' ... --- _id: '13937' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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' 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} }' 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.' 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.' 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.' short: F. Meyer auf der Heide, Mathematische Semesterberichte 66 (2019) 259–260. date_created: 2019-10-21T08:54:14Z date_updated: 2022-01-06T06:51:47Z department: - _id: '63' doi: 10.1007/s00591-019-00249-0 intvolume: ' 66' issue: '2' language: - iso: ger page: 259-260 publication: Mathematische Semesterberichte publication_status: published status: public title: 'Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln' type: journal_article user_id: '15415' volume: 66 year: '2019' ... --- _id: '13939' author: - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2019-10-21T13:20:43Z date_updated: 2022-01-06T06:51:47Z department: - _id: '63' doi: 10.1007/978-3-030-11072-7\_13 intvolume: ' 11340' language: - iso: eng page: 317-334 publication: Distributed Computing by Mobile Entities, Current Research in Moving and Computing publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Continuous Protocols for Swarm Robotics type: book_chapter user_id: '15415' volume: 11340 year: '2019' ... --- _id: '13942' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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} }' 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. 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. 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.' date_created: 2019-10-21T13:42:50Z date_updated: 2022-01-06T06:51:47Z department: - _id: '63' doi: 10.5220/0007369503150321 language: - iso: eng page: 315-321 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems publisher: SciTePress status: public title: Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location type: conference user_id: '477' year: '2019' ... --- _id: '13946' author: - first_name: Faisal N. full_name: Abu-Khzam, Faisal N. last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: 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} }' 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.' 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. 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. short: F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12. date_created: 2019-10-21T13:57:06Z date_updated: 2022-01-06T06:51:48Z department: - _id: '63' doi: 10.1016/j.tcs.2018.11.006 intvolume: ' 786' language: - iso: eng page: 2-12 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Theoretical Computer Science status: public title: Efficient parallel algorithms for parameterized problems type: journal_article user_id: '15415' volume: 786 year: '2019' ... --- _id: '14539' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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 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} }' 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. 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. 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. 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.' conference: end_date: 2019-07-04 location: L'Aquila, Italy name: SIROCCO 2019 start_date: 2019-07-01 date_created: 2019-11-04T10:09:35Z date_updated: 2022-01-06T06:52:00Z department: - _id: '79' - _id: '63' doi: 10.1007/978-3-030-24922-9\_26 language: - iso: eng page: 345-348 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) status: public title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks type: conference user_id: '477' year: '2019' ... --- _id: '10281' 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.' author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: 'Pascal ' full_name: 'Lenzner, Pascal ' last_name: Lenzner - first_name: Louise full_name: Molitor, Louise last_name: Molitor - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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.' 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} }' 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.' 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.' 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.' 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.' conference: location: Montreal QC, Canada name: 18th International Conference on Autonomous Agents and MultiAgent Systems date_created: 2019-06-20T14:46:08Z date_updated: 2022-01-06T06:50:33Z ddc: - '004' department: - _id: '541' - _id: '63' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T11:10:02Z date_updated: 2019-08-26T11:10:02Z file_id: '12962' file_name: 1903.04265.pdf file_size: 698599 relation: main_file success: 1 file_date_updated: 2019-08-26T11:10:02Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://dl.acm.org/citation.cfm?id=3331973 page: 1949--1951 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems publication_status: published publisher: International Foundation for Autonomous Agents and Multiagent Systems status: public title: ' From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation' type: conference user_id: '477' year: '2019' ... --- _id: '10344' author: - first_name: Simon full_name: Pukrop, Simon last_name: Pukrop citation: 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. 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} }' 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. mla: Pukrop, Simon. 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. date_created: 2019-07-04T07:21:19Z date_updated: 2022-01-06T06:50:37Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine type: mastersthesis user_id: '477' year: '2019' ... --- _id: '2484' 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. author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Anupam full_name: Gupta, Anupam last_name: Gupta - first_name: Guru full_name: Guruganesh, Guru last_name: Guruganesh - first_name: 'Amit ' full_name: 'Kumar, Amit ' last_name: Kumar - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: David full_name: Wajc, David last_name: Wajc citation: 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' 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' 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)} }' 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.' 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. 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. 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.' conference: end_date: 2018-07-13 location: Prag name: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) start_date: 2018-07-10 date_created: 2018-04-24T15:21:56Z date_updated: 2022-01-06T06:56:39Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.4230/LIPIcs.ICALP.2018.51 editor: - first_name: Ioannis full_name: Chatzigiannakis, Ioannis last_name: Chatzigiannakis - first_name: Christos full_name: Kaklamanis, Christos last_name: Kaklamanis - first_name: Dániel full_name: Marx, Dániel last_name: Marx - first_name: Donald full_name: Sannella, Donald last_name: Sannella external_id: arxiv: - '1711.01231' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:58:18Z date_updated: 2018-10-31T16:58:18Z file_id: '5227' file_name: LIPIcs-ICALP-2018-51.pdf file_size: 723824 relation: main_file success: 1 file_date_updated: 2018-10-31T16:58:18Z has_accepted_license: '1' intvolume: ' 107' language: - iso: eng page: 51:1-51:24 place: Dagstuhl, Germany 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 - _id: '7' name: SFB 901 - Subproject A3 - _id: '16' name: SFB 901 - Subproject C4 publication: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) publication_identifier: isbn: - 978-3-95977-076-7 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Fully-Dynamic Bin Packing with Little Repacking type: conference user_id: '14052' volume: 107 year: '2018' ... --- _id: '2485' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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' 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. 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. 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. 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.' conference: location: Wien name: SPAA'18 date_created: 2018-04-25T08:49:43Z date_updated: 2022-01-06T06:56:39Z ddc: - '000' department: - _id: '63' doi: 10.1145/3210377.3210389 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:42:33Z date_updated: 2018-11-02T14:42:33Z file_id: '5280' file_name: p373-feldkord.pdf file_size: 1207546 relation: main_file success: 1 file_date_updated: 2018-11-02T14:42:33Z has_accepted_license: '1' language: - iso: eng page: '373 - 381 ' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publication_status: published publisher: ACM status: public title: Online Facility Location with Mobile Facilities type: conference user_id: '477' year: '2018' ... --- _id: '25121' 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. author: - first_name: David Jan full_name: Liedtke, David Jan id: '55557' last_name: Liedtke citation: 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} }' chicago: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems, 2018. ieee: D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems. 2018. mla: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation Problems. 2018. short: D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation Problems, 2018. date_created: 2021-09-29T12:30:40Z date_updated: 2022-01-06T06:56:52Z ddc: - '000' department: - _id: '63' file: - access_level: local content_type: application/pdf creator: liedtke date_created: 2021-09-29T12:21:24Z date_updated: 2021-09-29T12:21:24Z file_id: '25124' file_name: Bachelor - Thesis.pdf file_size: 6746519 relation: main_file file_date_updated: 2021-09-29T12:21:24Z has_accepted_license: '1' language: - iso: eng status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Influence of Stationary Robots on Continuous Robot Formation Problems type: bachelorsthesis user_id: '55557' year: '2018' ... --- _id: '19978' abstract: - lang: eng 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." author: - first_name: Christine full_name: Markarian, Christine last_name: Markarian citation: ama: Markarian C. Online Connected Dominating Set Leasing. arXiv:180502994. 2018. apa: Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994. bibtex: '@article{Markarian_2018, title={Online Connected Dominating Set Leasing}, journal={arXiv:1805.02994}, author={Markarian, Christine}, year={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. mla: Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994, 2018. short: C. Markarian, ArXiv:1805.02994 (2018). date_created: 2020-10-12T12:42:54Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' language: - iso: eng publication: arXiv:1805.02994 status: public title: Online Connected Dominating Set Leasing type: preprint user_id: '15415' year: '2018' ... --- _id: '2831' 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.' author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik - first_name: Nadja full_name: Stroh-Maraun, Nadja id: '13264' last_name: Stroh-Maraun citation: 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' 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 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} }' 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. 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. 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. 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.' conference: end_date: 2018-06-18 location: Irvine, California, USA name: The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018) start_date: 2018-06-18 date_created: 2018-05-22T10:28:51Z date_updated: 2022-01-06T06:58:01Z ddc: - '040' department: - _id: '541' - _id: '63' - _id: '205' - _id: '475' doi: 10.1145/3230654.3230659 file: - access_level: closed content_type: application/pdf creator: nmaraun date_created: 2018-08-15T07:30:50Z date_updated: 2018-08-15T07:30:50Z file_id: '3910' file_name: Disaggregating User Evaluations Using the Shapley Value.pdf file_size: 1450171 relation: main_file success: 1 file_date_updated: 2018-08-15T07:30:50Z has_accepted_license: '1' language: - iso: eng page: 5:1-5:6 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) publication_identifier: isbn: - 978-1-4503-5916-0 publication_status: published status: public title: Disaggregating User Evaluations Using the Shapley Value type: conference user_id: '14052' year: '2018' ... --- _id: '2848' author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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 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} }' 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.' 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. 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. date_created: 2018-05-24T08:32:38Z date_updated: 2022-01-06T06:58:06Z ddc: - '000' department: - _id: '63' doi: 10.1007/s00453-018-0420-y file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:18:16Z date_updated: 2018-11-02T15:18:16Z file_id: '5298' file_name: TowardsFlexibleDemandsInOnline.pdf file_size: 600583 relation: main_file success: 1 file_date_updated: 2018-11-02T15:18:16Z has_accepted_license: '1' intvolume: ' 80' issue: '5' language: - iso: eng page: 1556–1574 project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: Algorithmica publisher: Springer status: public title: 'Towards Flexible Demands in Online Leasing Problems. ' type: journal_article user_id: '477' volume: 80 year: '2018' ... --- _id: '2849' author: - first_name: 'Faisal N. ' full_name: 'Abu-Khzam, Faisal N. ' last_name: Abu-Khzam - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Michael full_name: Schubert, Michael last_name: Schubert citation: 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 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} }' 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. 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. 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. short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018). date_created: 2018-05-24T08:39:15Z date_updated: 2022-01-06T06:58:06Z ddc: - '000' department: - _id: '63' doi: 10.1007/s00224-017-9836-z file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:24:32Z date_updated: 2018-11-02T15:24:32Z file_id: '5301' file_name: ApproximationAndHeuristicAlgor.pdf file_size: 1371624 relation: main_file success: 1 file_date_updated: 2018-11-02T15:24:32Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Theory of Computing Systems publication_identifier: unknown: - 1432-4350 publisher: Springer status: public title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks type: journal_article user_id: '477' year: '2018' ... --- _id: '2850' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby citation: 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' 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' 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} }' 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.' 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.' 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.' date_created: 2018-05-24T08:41:48Z date_updated: 2022-01-06T06:58:07Z ddc: - '000' department: - _id: '63' - _id: '238' doi: 10.4230/LIPIcs.FUN.2018.22 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-11-13T13:15:19Z date_updated: 2018-11-13T13:15:19Z file_id: '5536' file_name: LIPIcs-FUN-2018-22.pdf file_size: 554298 relation: main_file success: 1 file_date_updated: 2018-11-13T13:15:19Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Ninth International Conference on Fun with Algorithms (FUN) status: public title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets' type: conference user_id: '15415' year: '2018' ... --- _id: '24396' 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.' author: - first_name: Christine full_name: Markarian, Christine last_name: Markarian citation: 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 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} }' 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.' 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. short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.' date_created: 2021-09-14T12:23:29Z date_updated: 2022-01-06T06:56:19Z department: - _id: '63' doi: 10.1007/978-3-319-94667-2_18 language: - iso: eng place: Cham publication: International Workshop on Combinatorial Algorithms (IWOCA) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest type: conference user_id: '15415' year: '2018' ... --- _id: '3551' author: - first_name: Jürgen full_name: König, Jürgen id: '22358' last_name: König - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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 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 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} }' 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. 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. short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379. date_created: 2018-07-13T09:57:48Z date_updated: 2022-01-06T06:59:24Z ddc: - '000' department: - _id: '63' doi: 10.1007/s10878-018-0325-3 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:20:24Z date_updated: 2018-11-02T15:20:24Z file_id: '5299' file_name: SchedulingWithInterjobCommunic.pdf file_size: 745708 relation: main_file success: 1 file_date_updated: 2018-11-02T15:20:24Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1356-1379 project: - _id: '16' name: SFB 901 - Subproject C4 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publication: Journal of Combinatorial Optimization status: public title: Scheduling with interjob communication on parallel processors type: journal_article user_id: '477' volume: 36 year: '2018' ... --- _id: '3851' author: - first_name: Samuel full_name: Koop, Samuel last_name: Koop 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. bibtex: '@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }' chicago: Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018. ieee: S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 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. date_created: 2018-08-08T11:56:37Z date_updated: 2022-01-06T06:59:45Z department: - _id: '541' - _id: '63' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Congestion Games mit gewichteten Strategien type: bachelorsthesis user_id: '14052' year: '2018' ... --- _id: '17651' 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.' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Stojan full_name: Trajanovski, Stojan last_name: Trajanovski - first_name: Paola full_name: Grosso, Paola last_name: Grosso - first_name: Cees full_name: de Laat, Cees last_name: de Laat citation: 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.' 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} }' 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.' 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. 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. 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.' date_created: 2020-08-06T15:19:36Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' editor: - first_name: Donghyun full_name: Kim, 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 extern: '1' keyword: - flow - Red-Blue Set Cover - Positive-Negative Partial Set Cover - approximation - tree - MAX SNP-hard - root - leaf - dynamic programming - FPT language: - iso: eng page: 217-232 place: Cham publication: Combinatorial Optimization and Applications publication_identifier: isbn: - 978-3-030-04651-4 publisher: Springer International Publishing status: public title: Removing Undesirable Flows by Edge Deletion type: conference user_id: '83983' year: '2018' ... --- _id: '17666' abstract: - lang: eng 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.' author: - first_name: R. full_name: Koning, R. last_name: Koning - first_name: B. full_name: de Graaff, B. last_name: de Graaff - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: R. full_name: Meijer, R. last_name: Meijer - first_name: C. full_name: de Laat, C. last_name: de Laat - first_name: P. full_name: Grosso, P. last_name: Grosso citation: 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 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 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} }' 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. 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. 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. short: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018). date_created: 2020-08-06T15:23:11Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: https://doi.org/10.1016/j.future.2018.08.011 extern: '1' keyword: - Software defined networks - Network function virtualization - Cyber attacks - Cyber security - Defense efficiency - Overlay networks language: - iso: eng publication: Future Generation Computer Systems publication_identifier: issn: - 0167-739X status: public title: Measuring the efficiency of SDN mitigations against attacks on computer infrastructures type: journal_article user_id: '83983' year: '2018' ... --- _id: '63' author: - first_name: Ernst full_name: Althaus, Ernst last_name: Althaus - first_name: Andre full_name: Brinkmann, Andre last_name: Brinkmann - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Lars full_name: Nagel, Lars last_name: Nagel - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Jiri full_name: Sgall, Jiri last_name: Sgall - first_name: Tim full_name: Suess, Tim last_name: Suess citation: 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 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.' 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.' 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. 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. date_created: 2017-10-17T12:41:03Z date_updated: 2022-01-06T07:03:00Z ddc: - '040' department: - _id: '63' doi: 10.1007/s10951-017-0518-0 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:16:59Z date_updated: 2018-03-21T13:16:59Z file_id: '1577' file_name: 63-main_05.pdf file_size: 466808 relation: main_file success: 1 file_date_updated: 2018-03-21T13:16:59Z has_accepted_license: '1' intvolume: ' 21' issue: '1' language: - iso: eng page: 77-92 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Journal of Scheduling publisher: Springer status: public title: Scheduling Shared Continuous Resources on Many-Cores type: journal_article user_id: '15415' volume: 21 year: '2018' ... --- _id: '4411' 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." author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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} }' 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. 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. 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. 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.' conference: end_date: 2018-11-07 location: Tokyo name: 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) start_date: 2018-11-04 date_created: 2018-09-17T13:12:18Z date_updated: 2022-01-06T07:01:02Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-03232-6_1 editor: - first_name: Taisuke full_name: Izumi, Taisuke last_name: Izumi - first_name: Petr full_name: Kuznetsov, Petr last_name: Kuznetsov external_id: arxiv: - '1809.04923' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:38:37Z date_updated: 2018-11-02T14:38:37Z file_id: '5277' file_name: ASelf-stabilizingHashedPatrici.pdf file_size: 500005 relation: main_file success: 1 file_date_updated: 2018-11-02T14:38:37Z has_accepted_license: '1' intvolume: ' 11201' keyword: - Self-Stabilizing - Prefix Search - Distributed Data Structure language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publisher: Springer, Cham series_title: Lecture Notes of Computer Science status: public title: A Self-Stabilizing Hashed Patricia Trie type: conference user_id: '39241' volume: 11201 year: '2018' ... --- _id: '4563' abstract: - lang: eng 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" author: - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: 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.' 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} }' 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. 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. 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. 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.' conference: end_date: 2018-08-24 location: Helsinki name: '14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ' start_date: 2018-08-23 date_created: 2018-10-02T07:06:05Z date_updated: 2022-01-06T07:01:11Z ddc: - '000' department: - _id: '63' - _id: '79' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-01-11T10:32:38Z date_updated: 2019-01-11T10:32:38Z file_id: '6621' file_name: 23hybrid.pdf file_size: 349034 relation: main_file success: 1 file_date_updated: 2019-01-11T10:32:38Z has_accepted_license: '1' keyword: - greedy routing - ad hoc networks - convex hulls - c-competitiveness language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ' publisher: Springer status: public title: Competitive Routing in Hybrid Communication Networks type: conference user_id: '38705' year: '2018' ... --- _id: '4565' author: - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: 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' 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} }' 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.' 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.' 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.' conference: end_date: 2018-07-18 location: Wien name: SPAA'18 start_date: 2018-07-17 date_created: 2018-10-02T07:34:47Z date_updated: 2022-01-06T07:01:12Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1145/3210377.3210663 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:48:10Z date_updated: 2018-11-02T13:48:10Z file_id: '5254' file_name: p231-jung-1.pdf file_size: 1025077 relation: main_file success: 1 file_date_updated: 2018-11-02T13:48:10Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA) publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press status: public title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks' type: conference user_id: '38705' year: '2018' ... --- _id: '7570' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: 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' 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' 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} }' 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.' 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.' 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.' 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.' conference: end_date: 2018-07-18 location: Vienna name: 30th Symposium on Parallelism in Algorithms and Architectures start_date: 2018-07-16 date_created: 2019-02-06T14:16:19Z date_updated: 2022-01-06T07:03:40Z ddc: - '000' department: - _id: '63' doi: 10.1145/3210377.3210662 file: - access_level: closed content_type: application/pdf creator: jschaef date_created: 2019-02-06T14:18:35Z date_updated: 2019-02-06T14:18:35Z file_id: '7576' file_name: p359-meyer-auf-der-heide.pdf file_size: 1504739 relation: main_file file_date_updated: 2019-02-06T14:18:35Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18 publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press status: public title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents' type: conference user_id: '30291' year: '2018' ... --- _id: '4375' 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." author: - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: 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' 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 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} }' 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. 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. 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. 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.' conference: end_date: 2018-08-21 location: Helsinki name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) start_date: 2018-08-20 date_created: 2018-09-11T05:26:59Z date_updated: 2022-01-06T07:01:00Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-19759-9_4 file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2018-11-27T10:03:33Z date_updated: 2018-11-27T10:03:33Z file_id: '5863' file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf file_size: 1122875 relation: main_file success: 1 file_date_updated: 2018-11-27T10:03:33Z has_accepted_license: '1' keyword: - Distributed Storage - Multi-Dimensional Range Queries - Peer-to-Peer - Hilbert Curve language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) status: public title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension type: conference user_id: '14955' year: '2018' ... --- _id: '5403' author: - first_name: Marcel full_name: Geromel, Marcel last_name: Geromel citation: ama: Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018. apa: Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn. bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }' chicago: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. ieee: M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018. mla: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018. short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018. date_created: 2018-11-07T09:20:59Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Mobile Facility Leasing type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '5404' author: - first_name: Patrick Irenäus full_name: Kolpaczki, Patrick Irenäus last_name: Kolpaczki citation: ama: Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018. apa: Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn. 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} }' chicago: Kolpaczki, Patrick Irenäus. 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. 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. date_created: 2018-11-07T09:23:17Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Algorithmen für das k-Page Migration Problem type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '669' 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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 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 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} }' 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.' 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. 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. short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167. date_created: 2017-10-26T14:11:04Z date_updated: 2022-01-06T07:03:15Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/s10878-017-0189-y external_id: arxiv: - '1607.05143' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:57:32Z date_updated: 2018-10-31T16:57:32Z file_id: '5226' file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf file_size: 605207 relation: main_file success: 1 file_date_updated: 2018-10-31T16:57:32Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1145-1167 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Journal of Combinatorial Optimization publication_identifier: issn: - 1382-6905 - 1573-2886 publication_status: published publisher: Springer Nature status: public title: Congestion games with mixed objectives type: journal_article user_id: '14052' volume: 36 year: '2018' ... --- _id: '1186' author: - first_name: Arne full_name: Kemper, Arne last_name: Kemper citation: ama: Kemper A. 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. bibtex: '@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }' chicago: Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018. ieee: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018. mla: Kemper, Arne. 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. date_created: 2018-03-02T13:47:57Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Pure Nash Equilibria in Robust Congestion Games via Potential Functions type: mastersthesis user_id: '14052' year: '2018' ... --- _id: '1187' author: - first_name: Marcel full_name: Nachtigall, Marcel last_name: Nachtigall citation: ama: Nachtigall M. 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. 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. ieee: M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018. mla: Nachtigall, Marcel. 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. date_created: 2018-03-02T13:49:39Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Scenario-driven Strategy Analysis in a n-player Composition Game Model type: bachelorsthesis user_id: '14052' year: '2018' ... --- _id: '1188' author: - first_name: Jérôme full_name: Kempf, Jérôme last_name: Kempf citation: ama: Kempf J. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn; 2018. apa: Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn. bibtex: '@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }' chicago: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018. ieee: J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018. mla: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018. short: J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018. date_created: 2018-03-02T13:51:14Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Learning deterministic bandit behaviour form compositions type: bachelorsthesis user_id: '14052' year: '2018' ... --- _id: '1209' abstract: - lang: eng text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.' author: - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung citation: ama: Jung D. Local Strategies for Swarm Formations on a Grid. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-271 apa: Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-271 bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={10.17619/UNIPB/1-271}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }' chicago: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271. ieee: D. Jung, Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018. mla: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-271. short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018. date_created: 2018-03-13T10:26:16Z date_updated: 2022-01-06T06:51:17Z department: - _id: '63' doi: 10.17619/UNIPB/1-271 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication_identifier: isbn: - 978-3-942647-99-1 publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-271 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local Strategies for Swarm Formations on a Grid type: dissertation user_id: '15415' year: '2018' ... --- _id: '16392' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham; 2018. doi:10.1007/978-3-319-98355-4_18' apa: Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18 bibtex: '@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-98355-4_18}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }' chicago: Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Cham, 2018. https://doi.org/10.1007/978-3-319-98355-4_18. ieee: B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018. mla: Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18. short: 'B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.' date_created: 2020-04-03T07:04:59Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/978-3-319-98355-4_18 language: - iso: eng place: Cham publication: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications publication_identifier: isbn: - '9783319125671' - '9783319125688' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A Dynamic Distributed Data Structure for Top-k and k-Select Queries type: book_chapter user_id: '15415' year: '2018' ... --- _id: '1369' abstract: - lang: eng text: In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. 2018. doi:10.1007/s10878-018-0269-7 apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0269-7 bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={10.1007/s10878-018-0269-7}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }' chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7. ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018. mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7. short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018). date_created: 2018-03-18T11:12:49Z date_updated: 2022-01-06T06:51:42Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/s10878-018-0269-7 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:56:13Z date_updated: 2018-10-31T16:56:13Z file_id: '5225' file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf file_size: 561187 relation: main_file file_date_updated: 2018-10-31T16:56:13Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: Journal of Combinatorial Optimization publication_identifier: issn: - 1382-6905 - 1573-2886 publication_status: epub_ahead publisher: Springer Nature status: public title: Pure Nash equilibria in restricted budget games type: journal_article user_id: '14052' year: '2018' ... --- _id: '19604' author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li citation: ama: Li S. Parallel Fixed Parameter Tractable Problems. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-252 apa: Li, S. (2017). Parallel fixed parameter tractable problems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-252 bibtex: '@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={10.17619/UNIPB/1-252}, author={Li, Shouwei}, year={2017} }' chicago: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-252. ieee: S. Li, Parallel fixed parameter tractable problems. Universität Paderborn, 2017. mla: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252. short: S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017. date_created: 2020-09-21T13:52:09Z date_updated: 2022-01-06T06:54:07Z department: - _id: '63' doi: 10.17619/UNIPB/1-252 language: - iso: eng place: Universität Paderborn related_material: link: - relation: confirmation url: '10.17619/UNIPB/1-252 ' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Parallel fixed parameter tractable problems type: dissertation user_id: '15415' year: '2017' ... --- _id: '2851' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian citation: ama: 'Markarian C. Leasing with Uncertainty. In: International Conference on Operations Research (OR). ; 2017. doi:10.1007/978-3-319-89920-6_57' apa: Markarian, C. (2017). Leasing with Uncertainty. In International Conference on Operations Research (OR). Berlin. https://doi.org/10.1007/978-3-319-89920-6_57 bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={10.1007/978-3-319-89920-6_57}, booktitle={International Conference on Operations Research (OR)}, author={Markarian, Christine}, year={2017} }' chicago: Markarian, Christine. “Leasing with Uncertainty.” In International Conference on Operations Research (OR), 2017. https://doi.org/10.1007/978-3-319-89920-6_57. ieee: C. Markarian, “Leasing with Uncertainty,” in International Conference on Operations Research (OR), Berlin, 2017. mla: Markarian, Christine. “Leasing with Uncertainty.” International Conference on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57. short: 'C. Markarian, in: International Conference on Operations Research (OR), 2017.' conference: end_date: Sept 8, 2017 location: Berlin start_date: Sept 6, 2017 date_created: 2018-05-24T08:44:43Z date_updated: 2022-01-06T06:58:08Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-89920-6_57 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-11-13T13:16:30Z date_updated: 2018-11-13T13:16:30Z file_id: '5537' file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf file_size: 257103 relation: main_file success: 1 file_date_updated: 2018-11-13T13:16:30Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: International Conference on Operations Research (OR) status: public title: Leasing with Uncertainty type: conference user_id: '14052' year: '2017' ... --- _id: '24398' abstract: - lang: eng text: 'Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.' author: - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Christine full_name: Markarian, Christine last_name: Markarian - first_name: Pieter full_name: Simoens, Pieter last_name: Simoens - first_name: Andreagiovanni full_name: Reina, Andreagiovanni last_name: Reina citation: ama: 'Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12' apa: Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12 bibtex: '@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12}, booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}, year={2017} }' chicago: Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12. ieee: 'Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.' mla: Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.” International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12. short: 'Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017.' date_created: 2021-09-14T12:41:58Z date_updated: 2022-01-06T06:56:19Z department: - _id: '63' doi: 10.1007/978-3-319-59930-4_12 language: - iso: eng place: Cham publication: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Scheduling Access to Shared Space in Multi-robot Systems type: conference user_id: '15415' year: '2017' ... --- _id: '112' abstract: - lang: eng text: We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19' apa: Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19 bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }' chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19. ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233. mla: Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19. short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.' date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:58Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-57586-5_19 external_id: arxiv: - '1701.07304' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:05:37Z date_updated: 2018-03-21T13:05:37Z file_id: '1566' file_name: 112-FeldottoLederSkopalik2017.pdf file_size: 264089 relation: main_file success: 1 file_date_updated: 2018-03-21T13:05:37Z has_accepted_license: '1' page: 222--233 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) series_title: LNCS status: public title: Congestion Games with Complementarities type: conference user_id: '14052' year: '2017' ... --- _id: '113' abstract: - lang: eng text: We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7]. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Martin full_name: Gairing, Martin last_name: Gairing - first_name: Grammateia full_name: Kotsialou, Grammateia last_name: Kotsialou - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings of the 13th International Conference on Web and Internet Economics (WINE). ; 2017. doi:10.1007/978-3-319-71924-5_14' apa: Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE). https://doi.org/10.1007/978-3-319-71924-5_14 bibtex: '@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={10.1007/978-3-319-71924-5_14}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }' chicago: Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14. ieee: M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. mla: Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14. short: 'M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.' date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:59Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-71924-5_14 external_id: arxiv: - '1710.01634' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:01:32Z date_updated: 2018-10-31T17:01:32Z file_id: '5231' file_name: Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf file_size: 279055 relation: main_file success: 1 file_date_updated: 2018-10-31T17:01:32Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 13th International Conference on Web and Internet Economics (WINE) status: public title: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games type: conference user_id: '14052' year: '2017' ... --- _id: '17652' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Stojan full_name: Trajanovski, Stojan last_name: Trajanovski - first_name: Paola full_name: Grosso, Paola last_name: Grosso - first_name: Cees full_name: de Laat, Cees last_name: de Laat citation: ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-71150-8_1' apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1' bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }' chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.' ieee: 'G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.' mla: 'Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.' short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17.' date_created: 2020-08-06T15:19:48Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-71150-8_1 extern: '1' keyword: - flow - filter - MMSA - set cover - approximation - local ratio algorithm language: - iso: eng page: 3-17 place: Cham publication: 'Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I' publication_identifier: isbn: - 978-3-319-71150-8 publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Filtering Undesirable Flows in Networks type: conference user_id: '83983' year: '2017' ... --- _id: '17653' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:09Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - interaction - reciprocation - contribute - shared effort - curbing - convergence - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Reciprocation Effort Games type: conference user_id: '83983' year: '2017' ... --- _id: '17654' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:19Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - agents - projects - contribute - shared effort game - competition - quota - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Competition between Cooperative Projects type: conference user_id: '83983' year: '2017' ... --- _id: '17811' abstract: - lang: eng text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved." author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017. apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400. bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }' chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017. mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017). date_created: 2020-08-11T13:48:38Z date_updated: 2022-01-06T06:53:20Z department: - _id: '63' language: - iso: eng publication: arXiv:1702.03400 status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: preprint user_id: '15415' year: '2017' ... --- _id: '79' abstract: - lang: eng text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound. author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6' apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6 bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222}, collection={Lecture Notes in Computer Science} }' chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6. ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, vol. 10787, pp. 207–222. mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6. short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.' date_created: 2017-10-17T12:41:06Z date_updated: 2022-01-06T07:03:47Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-89441-6 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:59:22Z date_updated: 2018-11-02T14:59:22Z file_id: '5289' file_name: Non-clairvoyantSchedulingToMin.pdf file_size: 380629 relation: main_file success: 1 file_date_updated: 2018-11-02T14:59:22Z has_accepted_license: '1' intvolume: ' 10787' language: - iso: eng page: 207-222 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times type: conference user_id: '477' volume: 10787 year: '2017' ... --- _id: '82' abstract: - lang: eng text: Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter. author: - first_name: Faisal N. full_name: Abu-Khzam, Faisal N. last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW). LNCS. ; 2017:139-150. doi:10.1007/978-3-319-59605-1_13' apa: 'Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13' bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017, series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}, DOI={10.1007/978-3-319-59605-1_13}, booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150}, collection={LNCS} }' chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017. https://doi.org/10.1007/978-3-319-59605-1_13.' ieee: 'F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.' mla: 'Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.' short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.' date_created: 2017-10-17T12:41:07Z date_updated: 2022-01-06T07:03:52Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-59605-1_13 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:07:35Z date_updated: 2018-11-02T15:07:35Z file_id: '5294' file_name: Modular-WidthAnAuxiliaryParame.pdf file_size: 238276 relation: main_file success: 1 file_date_updated: 2018-11-02T15:07:35Z has_accepted_license: '1' language: - iso: eng page: 139-150 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) series_title: LNCS status: public title: 'Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity' type: conference user_id: '477' year: '2017' ... --- _id: '59' abstract: - lang: eng text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed). author: - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578' apa: 'Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132). https://doi.org/10.1145/3087556.3087578' bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }' chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.' ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.' mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.' short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.' date_created: 2017-10-17T12:41:02Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/3087556.3087578 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:17:33Z date_updated: 2018-03-21T13:17:33Z file_id: '1578' file_name: 59-progress.pdf file_size: 784867 relation: main_file success: 1 file_date_updated: 2018-03-21T13:17:33Z has_accepted_license: '1' language: - iso: eng page: 123--132 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource' type: conference user_id: '477' year: '2017' ... --- _id: '70' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2017:17-31. doi:10.1007/978-3-319-71147-8_2' apa: Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2 bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={10.1007/978-3-319-71147-8_2}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }' chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 17–31, 2017. https://doi.org/10.1007/978-3-319-71147-8_2. ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31. mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2. short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.' date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:26Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-71147-8_2 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:06:13Z date_updated: 2018-11-02T15:06:13Z file_id: '5293' file_name: PriceFluctuationInOnlineLeasin.pdf file_size: 287315 relation: main_file success: 1 file_date_updated: 2018-11-02T15:06:13Z has_accepted_license: '1' language: - iso: eng page: 17 - 31 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) status: public title: Price Fluctuations in Online Leasing type: conference user_id: '477' year: '2017' ... --- _id: '703' author: - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: Podlipyan P. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230 apa: Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230 bibtex: '@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={10.17619/UNIPB/1-230}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }' chicago: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230. ieee: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. mla: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230. short: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017. date_created: 2017-11-14T14:13:21Z date_updated: 2022-01-06T07:03:26Z department: - _id: '63' doi: 10.17619/UNIPB/1-230 language: - iso: eng publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-230 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local Algorithms for the Continuous Gathering Problem type: dissertation user_id: '15415' year: '2017' ... --- _id: '704' author: - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: Riechers S. Scheduling with Scarce Resources. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-231 apa: Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-231 bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }' chicago: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-231. ieee: S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017. mla: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231. short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017. date_created: 2017-11-15T07:51:07Z date_updated: 2022-01-06T07:03:27Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-231 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-11-14T15:18:37Z date_updated: 2018-11-14T15:18:37Z file_id: '5673' file_name: thesisStable.pdf file_size: 1491627 relation: main_file success: 1 file_date_updated: 2018-11-14T15:18:37Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Scheduling with Scarce Resources type: dissertation user_id: '14052' year: '2017' ... --- _id: '706' author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194. doi:10.1007/s10878-017-0198-x apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }' chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.' ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1168–1194, 2017. mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x. short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194. date_created: 2017-11-15T10:21:34Z date_updated: 2022-01-06T07:03:27Z ddc: - '040' department: - _id: '63' doi: 10.1007/s10878-017-0198-x file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T12:21:34Z date_updated: 2018-03-14T12:21:34Z file_id: '1210' file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf file_size: 608614 relation: main_file success: 1 file_date_updated: 2018-03-14T12:21:34Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1168-1194 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Journal of Combinatorial Optimization publisher: Springer status: public title: Cost-efficient Scheduling on Machines from the Cloud type: journal_article user_id: '15415' volume: 36 year: '2017' ...