[{"department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","doi":"10.1145/2935764.2935783","file":[{"file_id":"1518","creator":"florida","file_size":352996,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-21T10:41:40Z","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","date_created":"2018-03-21T10:41:40Z","access_level":"closed"}],"author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-21T10:41:40Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:33Z","abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"user_id":"14955","ddc":["040"],"citation":{"ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783.","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783","apa":"Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783"},"year":"2016","type":"conference","page":"417--427","_id":"215"},{"author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"last_name":"de Weerdt","first_name":"M.M.","full_name":"de Weerdt, M.M."},{"last_name":"Jonker","full_name":"Jonker, C.M.","first_name":"C.M."}],"department":[{"_id":"63"},{"_id":"541"}],"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","status":"public","date_created":"2020-08-06T15:20:30Z","volume":"Volume 285: ECAI 2016","extern":"1","user_id":"83983","title":"The Game of Reciprocation Habits","series_title":"Frontiers in Artificial Intelligence and Applications","language":[{"iso":"eng"}],"type":"conference","citation":{"chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. https://doi.org/10.3233/978-1-61499-672-9-417.","apa":"Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: Proceedings of the 2016 European Conference on Artificial Intelligence. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:10.3233/978-1-61499-672-9-417","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425."},"year":"2016","page":"417-425","_id":"17655","date_updated":"2022-01-06T06:53:16Z","doi":"10.3233/978-1-61499-672-9-417"},{"date_updated":"2022-01-06T06:53:16Z","_id":"17656","page":"1431-1432","citation":{"short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432.","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","apa":"Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32."},"type":"conference","year":"2016","language":[{"iso":"eng"}],"series_title":"AAMAS '16","title":"The Convergence of Reciprocation","user_id":"83983","extern":"1","place":"Richland, SC","publication_identifier":{"isbn":["978-1-4503-4239-1"]},"date_created":"2020-08-06T15:20:45Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"de Weerdt","first_name":"Mathijs","full_name":"de Weerdt, Mathijs"},{"full_name":"Jonker, Catholijn","first_name":"Catholijn","last_name":"Jonker"}]},{"date_updated":"2022-01-06T06:53:17Z","doi":"10.1007/978-3-319-48749-6_35","series_title":"LNCS","language":[{"iso":"eng"}],"title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"177","type":"conference","citation":{"chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_35.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={10.1007/978-3-319-48749-6_35}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488."},"year":"2016","page":"477-488","abstract":[{"text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.","lang":"eng"}],"ddc":["000"],"user_id":"477","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","last_name":"Markarian","id":"37612"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"file_date_updated":"2018-11-02T14:15:18Z","publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","file":[{"file_id":"5266","creator":"ups","file_size":293345,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T14:15:18Z","date_created":"2018-11-02T14:15:18Z","file_name":"OnTheParameterizedParallelComp.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:26Z"},{"date_updated":"2022-01-06T06:53:51Z","_id":"187","issue":"1","doi":"10.1145/2936716","year":"2016","type":"journal_editor","citation":{"mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.","bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={10.1145/2936716}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","chicago":"Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.","apa":"Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716","ama":"Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.; 2016. doi:10.1145/2936716","ieee":"F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016.","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016."},"page":"1","user_id":"15504","ddc":["040"],"title":"Introduction to the Special Issue on SPAA 2014","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-21T12:31:42Z","content_type":"application/pdf","creator":"florida","file_id":"1531","file_size":34053,"access_level":"closed","date_created":"2018-03-21T12:31:42Z","file_name":"187-a1-heide.pdf"}],"publication":"Transactions on Parallel Computing (TOPC)","file_date_updated":"2018-03-21T12:31:42Z","department":[{"_id":"63"}],"has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:41:28Z","editor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-48749-6_42","date_updated":"2022-01-06T06:54:33Z","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:32Z","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:18:51Z","file":[{"access_level":"closed","file_name":"Cost-EfficientSchedulingOnMach.pdf","date_created":"2018-11-02T14:18:51Z","date_updated":"2018-11-02T14:18:51Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":608614,"creator":"ups","file_id":"5268"}],"ddc":["000"],"user_id":"477","abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}"}],"citation":{"ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592. doi:10.1007/978-3-319-48749-6_42","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42"},"type":"conference","year":"2016","page":"578--592","_id":"207"},{"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:41Z","doi":"10.1007/978-3-319-48749-6_47","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"external_id":{"arxiv":["1607.05143"]},"title":"Congestion Games with Mixed Objectives","page":"655--669","type":"conference","citation":{"short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669). https://doi.org/10.1007/978-3-319-48749-6_47","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={10.1007/978-3-319-48749-6_47}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }"},"year":"2016","_id":"209","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-10-31T17:03:44Z","author":[{"last_name":"Feldotto","id":"14052","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file":[{"file_size":235739,"creator":"feldi","file_id":"5233","content_type":"application/pdf","date_updated":"2018-10-31T17:03:44Z","success":1,"relation":"main_file","date_created":"2018-10-31T17:03:44Z","file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:32Z","status":"public","has_accepted_license":"1","abstract":[{"text":"We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.","lang":"eng"}],"ddc":["000"],"user_id":"14052"},{"date_created":"2018-11-07T09:26:42Z","status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Jonas","full_name":"Bülling, Jonas","last_name":"Bülling"}],"title":"Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden","user_id":"22704","type":"bachelorsthesis","citation":{"bibtex":"@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}, author={Bülling, Jonas}, year={2016} }","mla":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.","chicago":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","apa":"Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.","ama":"Bülling J. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.; 2016.","ieee":"J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016.","short":"J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016."},"year":"2016","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:51Z","_id":"5406"},{"_id":"5407","date_updated":"2022-01-06T07:01:51Z","year":"2016","citation":{"short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","ieee":"J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.","chicago":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","ama":"Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.","apa":"Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","mla":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016."},"type":"bachelorsthesis","language":[{"iso":"eng"}],"title":"Price-Based Allocation Games","user_id":"477","publisher":"Universität Paderborn","author":[{"last_name":"Koepe","first_name":"Jörn","full_name":"Koepe, Jörn"}],"department":[{"_id":"63"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-11-07T09:45:57Z"},{"status":"public","date_created":"2017-11-14T06:50:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"author":[{"last_name":"Kutzias","first_name":"Damian","full_name":"Kutzias, Damian"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"user_id":"477","title":"Friendship Processes in Network Creation Games","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"2016","type":"mastersthesis","citation":{"short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","ieee":"D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","apa":"Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.","ama":"Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016.","chicago":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","mla":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }"},"date_updated":"2022-01-06T07:03:23Z","_id":"688"},{"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"year":"2016","type":"mastersthesis","citation":{"short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","ieee":"J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","chicago":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","apa":"Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn.","ama":"Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016.","mla":"Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016.","bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }"},"_id":"689","date_updated":"2022-01-06T07:03:23Z","status":"public","date_created":"2017-11-14T06:51:37Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"author":[{"last_name":"Schaefer","id":"30291","first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}],"user_id":"477","title":"Routing Algorithms on Delayed Networks for Disaster Management Support"},{"date_created":"2020-04-07T07:20:47Z","status":"public","publication":"arXiv:1602.03303","department":[{"_id":"63"}],"author":[{"full_name":"Cord-Landwehr, Andreas ","first_name":"Andreas ","last_name":"Cord-Landwehr"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"id":"37827","last_name":"Jung","full_name":"Jung, Daniel","first_name":"Daniel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"user_id":"15415","title":"Asymptotically Optimal Gathering on a Grid","external_id":{"arxiv":["1602.03303"]},"abstract":[{"lang":"eng","text":"In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$."}],"language":[{"iso":"eng"}],"type":"preprint","citation":{"short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016).","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.","chicago":"Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016.","bibtex":"@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016."},"year":"2016","date_updated":"2022-01-06T06:52:50Z","_id":"16450"},{"page":"278--293","citation":{"chicago":"Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.","apa":"Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18","ama":"Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18","mla":"Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.","bibtex":"@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }","short":"T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.","ieee":"T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293."},"year":"2016","type":"conference","_id":"169","publication":"Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)","file_date_updated":"2018-03-21T12:41:08Z","author":[{"first_name":"Thomas","full_name":"Kühne, Thomas","last_name":"Kühne","id":"49079"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Arifulina","first_name":"Svetlana","full_name":"Arifulina, Svetlana"},{"id":"107","last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"}],"file":[{"access_level":"closed","file_name":"169-kuehne.pdf","date_created":"2018-03-21T12:41:08Z","content_type":"application/pdf","date_updated":"2018-03-21T12:41:08Z","relation":"main_file","success":1,"file_size":2069427,"file_id":"1540","creator":"florida"}],"date_created":"2017-10-17T12:41:25Z","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study."}],"ddc":["040"],"user_id":"57458","series_title":"LNCS 9594","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:58Z","doi":"10.1007/978-3-319-30668-1_18","department":[{"_id":"66"},{"_id":"238"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application"},{"title":"Über die Rolle von Informationen in Verkehrsnetzwerken","user_id":"14052","status":"public","date_created":"2017-12-19T10:10:17Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","author":[{"last_name":"Handirk","first_name":"Tobias","full_name":"Handirk, Tobias"}],"department":[{"_id":"63"},{"_id":"541"}],"_id":"1082","date_updated":"2022-01-06T06:50:51Z","citation":{"short":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016.","ieee":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","apa":"Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.","ama":"Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016.","chicago":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","bibtex":"@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }","mla":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016."},"year":"2016","type":"bachelorsthesis","language":[{"iso":"ger"}],"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}]},{"date_updated":"2022-01-06T06:52:23Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089"}]},"title":"Selfish Network Creation - On Variants of Network Creation Games","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication_identifier":{"isbn":["978-3-942647-72-4"]},"department":[{"_id":"63"},{"_id":"26"}],"intvolume":" 353","_id":"154","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2016","type":"dissertation","citation":{"short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","ieee":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","chicago":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","apa":"Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","mla":"Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"user_id":"5786","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:22Z","volume":353,"file":[{"access_level":"closed","file_name":"154-dissertation.pdf","date_created":"2018-03-21T12:52:03Z","relation":"main_file","success":1,"date_updated":"2018-03-21T12:52:03Z","content_type":"application/pdf","file_id":"1551","creator":"florida","file_size":800101}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"}],"file_date_updated":"2018-03-21T12:52:03Z"},{"file":[{"file_size":753147,"file_id":"1549","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T12:50:29Z","success":1,"relation":"main_file","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","date_created":"2018-03-21T12:50:29Z","access_level":"closed"}],"author":[{"last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"},{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-03-21T12:50:29Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:22Z","abstract":[{"text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.","lang":"eng"}],"user_id":"15504","ddc":["040"],"type":"conference","year":"2016","citation":{"apa":"König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:563--577. doi:10.1007/978-3-319-48749-6_41","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41.","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577."},"page":"563--577","_id":"157","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Scheduling with Interjob Communication on Parallel Processors","series_title":"LNCS","date_updated":"2022-01-06T06:52:32Z","doi":"10.1007/978-3-319-48749-6_41"},{"department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Routing Games With Progressive Filling","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:40Z","doi":"10.1109/TNET.2015.2468571","publication":"IEEE/ACM Transactions on Networking","file_date_updated":"2018-03-21T12:48:02Z","publisher":"IEEE","author":[{"full_name":"Harks, Tobias","first_name":"Tobias","last_name":"Harks"},{"first_name":"Martin","full_name":"Höfer, Martin","last_name":"Höfer"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"file":[{"date_updated":"2018-03-21T12:48:02Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":1655309,"file_id":"1547","creator":"florida","access_level":"closed","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","date_created":"2018-03-21T12:48:02Z"}],"date_created":"2017-10-17T12:41:23Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}],"ddc":["040"],"user_id":"477","page":"2553 - 2562","type":"journal_article","year":"2016","citation":{"ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571","apa":"Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562. https://doi.org/10.1109/TNET.2015.2468571"},"_id":"159","issue":"4"},{"_id":"149","year":"2016","citation":{"chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43.","apa":"Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43","ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43","mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607."},"type":"conference","page":"593--607","user_id":"477","ddc":["040"],"abstract":[{"text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).","lang":"eng"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:21Z","file":[{"file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","date_created":"2018-03-21T12:55:43Z","access_level":"closed","file_id":"1553","creator":"florida","file_size":236253,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-21T12:55:43Z"}],"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"full_name":"Feldkord, Björn","first_name":"Björn","id":"22704","last_name":"Feldkord"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file_date_updated":"2018-03-21T12:55:43Z","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","doi":"10.1007/978-3-319-48749-6_43","date_updated":"2022-01-06T06:52:10Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Strategic Online Facility Location","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}]},{"editor":[{"full_name":"Dressler, Falko","first_name":"Falko","last_name":"Dressler"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2017-10-17T12:41:23Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","department":[{"_id":"63"}],"publisher":"ACM","title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","user_id":"15504","citation":{"mla":"Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358.","bibtex":"@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}, DOI={10.1145/2942358}, publisher={ACM}, year={2016} }","ama":"Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016. doi:10.1145/2942358","apa":"Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358","chicago":"Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358.","ieee":"F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016.","short":"F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016."},"year":"2016","type":"conference_editor","doi":"10.1145/2942358","conference":{"end_date":"2016-07-08","start_date":"2016-07-04","name":"MobiHoc","location":"Paderborn, Germany"},"_id":"163","date_updated":"2022-01-06T06:52:48Z"},{"abstract":[{"text":"Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.\r\n","lang":"eng"}],"user_id":"15415","publication":"Algorithm Engineering","author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Petring, Ralf","first_name":"Ralf","last_name":"Petring"}],"publisher":"Springer","date_created":"2020-03-30T10:21:53Z","status":"public","volume":9220,"_id":"16351","intvolume":" 9220","page":"226-244","citation":{"chicago":"Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7 .","ama":"Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 ","apa":"Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7 ","bibtex":"@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS}, title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220}, DOI={10.1007/978-3-319-49487-6_7 }, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}, editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244}, collection={LNCS} }","mla":"Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .","short":"M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann, P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.","ieee":"M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016, vol. 9220, pp. 226–244."},"type":"conference","year":"2016","title":"Algorithm Engineering Aspects of Real-Time Rendering Algorithms","department":[{"_id":"63"}],"editor":[{"last_name":"Kliemann","full_name":"Kliemann, Lasse","first_name":"Lasse"},{"last_name":"Sanders","first_name":"Peter","full_name":"Sanders, Peter"}],"date_updated":"2022-01-06T06:52:49Z","doi":"10.1007/978-3-319-49487-6_7 ","series_title":"LNCS","language":[{"iso":"eng"}]}]