[{"citation":{"apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. <i>ArXiv:1602.03303</i>.","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, 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.” <i>ArXiv:1602.03303</i>, 2016.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. <i>arXiv:160203303</i>. 2016.","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” <i>arXiv:1602.03303</i>. 2016.","chicago":"Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” <i>ArXiv:1602.03303</i>, 2016."},"year":"2016","author":[{"first_name":"Andreas ","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas "},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-04-07T07:20:47Z","date_updated":"2022-01-06T06:52:50Z","title":"Asymptotically Optimal Gathering on a Grid","type":"preprint","publication":"arXiv:1602.03303","status":"public","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)$."}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16450","external_id":{"arxiv":["1602.03303"]},"language":[{"iso":"eng"}]},{"type":"conference","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","abstract":[{"lang":"eng","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."}],"file":[{"creator":"florida","date_created":"2018-03-21T12:50:29Z","date_updated":"2018-03-21T12:50:29Z","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","access_level":"closed","file_id":"1549","file_size":753147,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"157","series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-21T12:50:29Z","has_accepted_license":"1","year":"2016","citation":{"ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577.","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 <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:563--577. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>","bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>}, 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.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>.","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.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 563--577). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>"},"page":"563--577","date_updated":"2022-01-06T06:52:32Z","date_created":"2017-10-17T12:41:22Z","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"}],"title":"Scheduling with Interjob Communication on Parallel Processors","doi":"10.1007/978-3-319-48749-6_41"},{"type":"conference_editor","editor":[{"full_name":"Dressler, Falko","last_name":"Dressler","first_name":"Falko"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","_id":"163","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"15504","year":"2016","citation":{"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={<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>}, publisher={ACM}, year={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.","mla":"Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>.","apa":"Dressler, F., &#38; Meyer auf der Heide, F. (Eds.). (2016). <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. Presented at the MobiHoc, Paderborn, Germany: ACM. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>","ieee":"F. Dressler and F. Meyer auf der Heide, Eds., <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016.","chicago":"Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>.","ama":"Dressler F, Meyer auf der Heide F, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>"},"publisher":"ACM","date_updated":"2022-01-06T06:52:48Z","date_created":"2017-10-17T12:41:23Z","title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","doi":"10.1145/2942358","conference":{"start_date":"2016-07-04","name":"MobiHoc","location":"Paderborn, Germany","end_date":"2016-07-08"}},{"intvolume":"      9220","page":"226-244","citation":{"apa":"Fischer, M., Jähn, C., Meyer auf der Heide, F., &#38; Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann &#38; P. Sanders (Eds.), <i>Algorithm Engineering</i> (Vol. 9220, pp. 226–244). Springer. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">https://doi.org/10.1007/978-3-319-49487-6_7 </a>","mla":"Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>.","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={<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>}, 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} }","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.","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. <i>Algorithm Engineering</i>. Vol 9220. LNCS. Springer; 2016:226-244. doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>","chicago":"Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">https://doi.org/10.1007/978-3-319-49487-6_7 </a>.","ieee":"M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in <i>Algorithm Engineering</i>, 2016, vol. 9220, pp. 226–244."},"year":"2016","doi":"10.1007/978-3-319-49487-6_7 ","title":"Algorithm Engineering Aspects of Real-Time Rendering Algorithms","volume":9220,"author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Ralf","full_name":"Petring, Ralf","last_name":"Petring"}],"date_created":"2020-03-30T10:21:53Z","publisher":"Springer","date_updated":"2022-01-06T06:52:49Z","status":"public","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"}],"editor":[{"first_name":"Lasse","last_name":"Kliemann","full_name":"Kliemann, Lasse"},{"full_name":"Sanders, Peter","last_name":"Sanders","first_name":"Peter"}],"publication":"Algorithm Engineering","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"15415","_id":"16351"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"16358","language":[{"iso":"eng"}],"publication":"Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","type":"conference","status":"public","date_created":"2020-04-01T12:28:09Z","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"date_updated":"2022-01-06T06:52:49Z","publisher":"Springer","doi":"10.1007/978-3-319-53058-1_5 ","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","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. In: <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer; 2016. doi:<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, 2016.","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.” In <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">https://doi.org/10.1007/978-3-319-53058-1_5 </a>.","apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">https://doi.org/10.1007/978-3-319-53058-1_5 </a>","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, Springer, 2016, doi:<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>.","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.","bibtex":"@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>}, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016} }"},"year":"2016"},{"title":"Asymptotically Optimal Gathering on a Grid","doi":"10.1145/2935764.2935789","date_updated":"2022-01-06T06:52:49Z","publisher":"ACM","date_created":"2020-04-01T12:46:35Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2016","citation":{"ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2016:301-312. doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 301–312.","chicago":"Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 301–12. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>.","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.","bibtex":"@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2016, pp. 301–12, doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 301–312). ACM. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>"},"page":"301-312","language":[{"iso":"eng"}],"_id":"16359","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2)."}],"status":"public","type":"conference","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)"},{"page":"689-699","citation":{"bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2016, pp. 689–99, doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.","apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 689–699). IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 689–99. IEEE, 2016. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>.","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, pp. 689–699.","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2016:689-699. doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>"},"year":"2016","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"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"}],"date_created":"2020-04-01T12:56:43Z","date_updated":"2022-01-06T06:52:49Z","publisher":"IEEE","doi":"10.1109/IPDPS.2016.51","title":"Gathering a Closed Chain of Robots on a Grid","publication":"Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","status":"public","abstract":[{"text":"We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. ","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16360","language":[{"iso":"eng"}]},{"status":"public","publication":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","language":[{"iso":"eng"}],"_id":"16364","department":[{"_id":"63"}],"user_id":"15415","year":"2016","citation":{"bibtex":"@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }","mla":"Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>.","short":"A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","apa":"Macker, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>","ieee":"A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016.","chicago":"Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>.","ama":"Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>"},"publication_identifier":{"isbn":["9781509021406"]},"publication_status":"published","title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","doi":"10.1109/ipdps.2016.91","date_updated":"2022-01-06T06:52:49Z","author":[{"first_name":"Alexander","full_name":"Macker, Alexander","last_name":"Macker"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-02T10:14:25Z"},{"date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T09:24:28Z","author":[{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","year":"2016","citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>arXiv:160901184</i>. 2016.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>arXiv:1609.01184</i>. 2016.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. <i>ArXiv:1609.01184</i>.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016).","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016."},"external_id":{"arxiv":["1609.01184"]},"_id":"16396","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"arXiv:1609.01184","type":"preprint","abstract":[{"text":"We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n  Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$.","lang":"eng"}],"status":"public"},{"publisher":"Springer","date_created":"2017-10-17T12:41:18Z","title":"Towards the price of leasing online","issue":"4","year":"2016","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Journal of Combinatorial Optimization","abstract":[{"text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","file_id":"5318","file_size":654903,"date_created":"2018-11-02T15:57:25Z","creator":"ups","date_updated":"2018-11-02T15:57:25Z"}],"date_updated":"2022-01-06T06:51:46Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"full_name":"Markarian, Christine","id":"37612","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Peter ","full_name":"Pietrzyk, Peter ","last_name":"Pietrzyk"}],"doi":"10.1007/s10878-015-9915-5","has_accepted_license":"1","page":" 1197--1216","citation":{"ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216. doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>, no. 4, pp. 1197--1216, 2016.","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>.","apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk, P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>, (4), 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>.","bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }"},"_id":"139","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"user_id":"477","file_date_updated":"2018-11-02T15:57:25Z","type":"journal_article","status":"public"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":234587,"file_id":"5269","access_level":"closed","file_name":"TheMonotoneCircuitValueProblem.pdf","date_updated":"2018-11-02T14:20:45Z","date_created":"2018-11-02T14:20:45Z","creator":"ups"}],"status":"public","abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}],"type":"conference","publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:20:45Z","ddc":["000"],"user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"143","citation":{"ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>. LNCS. ; 2016:92-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102.","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 92–102. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>.","mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N.  and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i> (pp. 92–102). <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>"},"page":"92-102","year":"2016","has_accepted_license":"1","doi":"10.1007/978-3-319-42634-1_8","title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","author":[{"full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam","first_name":"Faisal N. "},{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"date_created":"2017-10-17T12:41:19Z","date_updated":"2022-01-06T06:51:57Z"},{"type":"book_editor","status":"public","editor":[{"last_name":"Gausemeier","full_name":"Gausemeier, Jürgen","first_name":"Jürgen"},{"first_name":"Michael","full_name":"Grafe, Michael","last_name":"Grafe"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"department":[{"_id":"676"}],"series_title":"Band 342 ","user_id":"21240","_id":"28325","language":[{"iso":"ger"}],"citation":{"chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>. Vol. Band 342. Band 342 . Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, 2015.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>, vol. Band 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, 2015.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F, eds. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>. Vol Band 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung; 2015.","short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR, Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Paderborn, 2015.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, series={Band 342 }, title={Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}, volume={Band 342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, year={2015}, collection={Band 342 } }","mla":"Gausemeier, Jürgen, et al., editors. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, 2015.","apa":"Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (Eds.). (2015). <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR: Vol. Band 342</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung."},"place":"Paderborn","year":"2015","volume":"Band 342 ","date_created":"2021-12-06T10:37:33Z","date_updated":"2022-01-06T06:58:01Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts; , 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR"},{"title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR ","volume":342,"author":[{"full_name":"Gausemeier, Jürgen","last_name":"Gausemeier","first_name":"Jürgen"},{"last_name":"Grafe","full_name":"Grafe, Michael","first_name":"Michael"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2021-10-15T09:28:48Z","date_updated":"2022-01-06T06:57:18Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"       342","citation":{"short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR , Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2015, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR }, volume={342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide, Friedhelm}, year={2015}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Gausemeier, Jürgen, et al. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR </i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","apa":"Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (2015). <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR </i> (Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR </i>. Vol. 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR </i>, vol. 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F. <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR </i>. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2015."},"year":"2015","language":[{"iso":"ger"}],"department":[{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"60046","_id":"26229","status":"public","type":"book"},{"type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","abstract":[{"lang":"eng","text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". "}],"file":[{"file_id":"1478","file_name":"266-p343-markarian.pdf","access_level":"closed","file_size":679580,"date_created":"2018-03-21T09:33:11Z","creator":"florida","date_updated":"2018-03-21T09:33:11Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"266","user_id":"15504","department":[{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:33:11Z","has_accepted_license":"1","year":"2015","citation":{"ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>"},"page":"343-344","date_updated":"2022-01-06T06:57:22Z","author":[{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2017-10-17T12:41:44Z","title":"Online Resource Leasing","doi":"10.1145/2767386.2767454"},{"type":"conference","publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","file":[{"creator":"florida","date_created":"2018-03-21T09:28:34Z","date_updated":"2018-03-21T09:28:34Z","file_id":"1473","file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","access_level":"closed","file_size":215498,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","editor":[{"first_name":"Frank","last_name":"Dehne","full_name":"Dehne, Frank"},{"full_name":"Sack, Jörg Rüdiger","last_name":"Sack","first_name":"Jörg Rüdiger"},{"last_name":"Stege","full_name":"Stege, Ulrike","first_name":"Ulrike"}],"abstract":[{"text":"Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.","lang":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"274","file_date_updated":"2018-03-21T09:28:34Z","ddc":["040"],"has_accepted_license":"1","citation":{"mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne et al., 2015, pp. 542--553, doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553). <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553. doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, 2015, pp. 542--553.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>."},"page":"542--553","year":"2015","date_created":"2017-10-17T12:41:45Z","author":[{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","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"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"date_updated":"2022-01-06T06:57:39Z","doi":"10.1007/978-3-319-21840-3_45","title":"Non-preemptive Scheduling on Machines with Setup Times"},{"title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR","date_created":"2020-07-28T13:39:25Z","volume":342,"date_updated":"2022-01-06T06:53:12Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","citation":{"apa":"Gausemeier, J., Grafe, M., &#38; Meyer auf der Heide, F. (Eds.). (2015). <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i> (12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf Instituts.","short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR, 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, title={Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2015} }","mla":"Gausemeier, Jürgen, et al., editors. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., <i>Augmented &#38; Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR</i>, 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F, eds. <i>Augmented &#38; Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR</i>. Vol 342. 12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015."},"intvolume":"       342","year":"2015","place":"Paderborn","edition":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"_id":"17431","status":"public","editor":[{"full_name":"Gausemeier, Jürgen","last_name":"Gausemeier","first_name":"Jürgen"},{"last_name":"Grafe","full_name":"Grafe, Michael","first_name":"Michael"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"type":"book_editor"},{"doi":"10.1007/978-3-319-21398-9_22","title":"Towards Flexible Demands in Online Leasing Problems","date_created":"2017-10-17T12:41:38Z","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker","first_name":"Alexander"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"date_updated":"2022-01-06T06:56:05Z","page":"277--288","citation":{"apa":"Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Towards Flexible Demands in Online Leasing Problems. In <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i> (pp. 277--288). <a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">https://doi.org/10.1007/978-3-319-21398-9_22</a>","bibtex":"@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>}, booktitle={Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015}, pages={277--288}, collection={Lecture Notes in Computer Science} }","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288, doi:<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>.","short":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.","ama":"Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible Demands in Online Leasing Problems. In: <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>. Lecture Notes in Computer Science. ; 2015:277--288. doi:<a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">10.1007/978-3-319-21398-9_22</a>","ieee":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards Flexible Demands in Online Leasing Problems,” in <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288.","chicago":"Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.” In <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>, 277--288. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21398-9_22\">https://doi.org/10.1007/978-3-319-21398-9_22</a>."},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-21T10:28:50Z","ddc":["040"],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","_id":"240","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"creator":"florida","date_created":"2018-03-21T10:28:50Z","date_updated":"2018-03-21T10:28:50Z","access_level":"closed","file_id":"1498","file_name":"240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf","file_size":264482,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem."}],"publication":"Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)","type":"conference"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"16449","external_id":{"arxiv":["1510.05454"]},"language":[{"iso":"eng"}],"publication":"arXiv:1510.05454","type":"preprint","status":"public","abstract":[{"text":"We consider the following variant of the two dimensional gathering problem\r\nfor swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe grid and must keep this connectivity during the whole process of their\r\ngathering. Connectivity means, that neighboring robots of the chain need to be\r\npositioned at the same or neighboring points of the grid. In our model,\r\ngathering means to keep shortening the chain until the robots are located\r\ninside a $2\\times 2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates, no compass, no global communication or vision, \\ldots).\r\nEach robot can only see its next constant number of left and right neighbors on\r\nthe chain. This fixed constant is called the \\emph{viewing path length}. All\r\nits operations and detections are restricted to this constant number of robots.\r\nOther robots, even if located at neighboring or the same grid point cannot be\r\ndetected. Only based on the relative positions of its detectable chain\r\nneighbors, a robot can decide to obtain a certain state. Based on this state\r\nand their local knowledge, the robots do local modifications to the chain by\r\nmoving to neighboring grid points without breaking the chain. These\r\nmodifications are performed without the knowledge whether they lead to a global\r\nprogress or not. We assume the fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a gathering algorithm which needs linear time. This\r\nresult generalizes the result from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and fixed) endpoints is considered.","lang":"eng"}],"author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"first_name":"Andreas ","full_name":"Cord-Landwehr, Andreas ","last_name":"Cord-Landwehr"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-07T07:20:46Z","date_updated":"2022-01-06T06:52:50Z","title":"Gathering a Closed Chain of Robots on a Grid","citation":{"ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. <i>arXiv:151005454</i>. 2015.","chicago":"Abshoff, Sebastian, Andreas  Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” <i>ArXiv:1510.05454</i>, 2015.","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” <i>arXiv:1510.05454</i>. 2015.","apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. <i>ArXiv:1510.05454</i>.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1510.05454 (2015).","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” <i>ArXiv:1510.05454</i>, 2015.","bibtex":"@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas  and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }"},"year":"2015"},{"citation":{"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,” <i>arXiv:1510.01866</i>. 2015.","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.” <i>ArXiv:1510.01866</i>, 2015.","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. <i>arXiv:151001866</i>. 2015.","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks. <i>ArXiv:1510.01866</i>.","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks}, journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866 (2015).","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks.” <i>ArXiv:1510.01866</i>, 2015."},"year":"2015","title":"Approximation and Heuristic Algorithms for Computing Backbones in  Asymmetric Ad-Hoc Networks","author":[{"first_name":"Faisal N. ","full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Michael","full_name":"Schubert, Michael","last_name":"Schubert"}],"date_created":"2020-04-07T12:22:48Z","date_updated":"2022-01-06T06:52:50Z","status":"public","abstract":[{"text":"We consider the problem of dominating set-based virtual backbone used for\r\nrouting in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission ranges and are modeled using the well-established disk graphs. The\r\ncorresponding graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is strongly connected and each node in the graph is\r\neither in the set or has both an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem are of practical significance due to\r\nthe dynamic nature of ad-hoc networks. We present a first distributed\r\napproximation algorithm, with a constant approximation factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover we present a\r\nsimple heuristic algorithm and conduct an extensive simulation study showing\r\nthat our heuristic outperforms previously known approaches for the problem.","lang":"eng"}],"publication":"arXiv:1510.01866","type":"preprint","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","external_id":{"arxiv":["1510.01866"]},"_id":"16452"},{"publication":"Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","abstract":[{"lang":"eng","text":"Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual online data stream of numbers and, at any point in time, the\r\ncoordinator has to know the k nodes currently observing the largest values, for\r\na given k between 1 and n. We design and analyze an algorithm that solves this\r\nproblem while bounding the amount of messages exchanged between the nodes and\r\nthe coordinator. Our algorithm employs the idea of using filters which,\r\nintuitively speaking, leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous ones. The algorithm uses a number of messages that is\r\non expectation by a factor of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest value observed by any node."}],"status":"public","_id":"16460","external_id":{"arxiv":["1410.7912"]},"department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"year":"2015","page":"357-364","citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring of Distributed Data Streams. In: <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2015:357-364. doi:<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>","ieee":"A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position Monitoring of Distributed Data Streams,” in <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2015, pp. 357–364.","chicago":"Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Online Top-k-Position Monitoring of Distributed Data Streams.” In <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 357–64. IEEE, 2015. <a href=\"https://doi.org/10.1109/IPDPS.2015.40\">https://doi.org/10.1109/IPDPS.2015.40</a>.","apa":"Mäcker, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2015). Online Top-k-Position Monitoring of Distributed Data Streams. In <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 357–364). IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2015.40\">https://doi.org/10.1109/IPDPS.2015.40</a>","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2015, pp. 357–364.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online Top-k-Position Monitoring of Distributed Data Streams}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>}, booktitle={Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }","mla":"Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed Data Streams.” <i>Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2015, pp. 357–64, doi:<a href=\"https://doi.org/10.1109/IPDPS.2015.40\">10.1109/IPDPS.2015.40</a>."},"date_updated":"2022-01-06T06:52:50Z","publisher":"IEEE","author":[{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-08T07:02:15Z","title":"Online Top-k-Position Monitoring of Distributed Data Streams","doi":"10.1109/IPDPS.2015.40"}]