[{"_id":"50458","publisher":"Springer Science and Business Media LLC","user_id":"44428","status":"public","citation":{"ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>"},"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00453-023-01189-x","author":[{"last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten","id":"88252"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"44428","first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2023","title":"Server Cloud Scheduling","publication_status":"published","date_updated":"2024-01-11T11:19:33Z","date_created":"2024-01-11T11:10:53Z","department":[{"_id":"63"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","publication":"Algorithmica","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>","lang":"eng"}]},{"citation":{"mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>.","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022)."},"publication":"Algorithmica","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2022-05-27T10:09:24Z","department":[{"_id":"63"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"first_name":"Surender","last_name":"Baswana","full_name":"Baswana, Surender"},{"last_name":"Gupta","first_name":"Shiv","full_name":"Gupta, Shiv"},{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","id":"39241"}],"year":"2022","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","status":"public","publication_status":"published","date_updated":"2022-05-27T10:14:27Z","_id":"31479","language":[{"iso":"eng"}],"publisher":"Springer Science and Business Media LLC","genbank":["tillk"],"user_id":"39241","doi":"10.1007/s00453-022-00978-0"},{"user_id":"15415","volume":57,"page":"562-584","_id":"19011","status":"public","citation":{"ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” <i>Algorithmica</i>, vol. 57, no. 3, pp. 562–584, 2010.","apa":"Degener, B., Gehweiler, J., &#38; Lammersen, C. (2010). Kinetic Facility Location. <i>Algorithmica</i>, <i>57</i>(3), 562–584. <a href=\"https://doi.org/10.1007/s00453-008-9250-7\">https://doi.org/10.1007/s00453-008-9250-7</a>","short":"B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.","chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic Facility Location.” <i>Algorithmica</i> 57, no. 3 (2010): 562–84. <a href=\"https://doi.org/10.1007/s00453-008-9250-7\">https://doi.org/10.1007/s00453-008-9250-7</a>.","mla":"Degener, Bastian, et al. “Kinetic Facility Location.” <i>Algorithmica</i>, vol. 57, no. 3, 2010, pp. 562–84, doi:<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>.","bibtex":"@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location}, volume={57}, DOI={<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>}, number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2010}, pages={562–584} }","ama":"Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. <i>Algorithmica</i>. 2010;57(3):562-584. doi:<a href=\"https://doi.org/10.1007/s00453-008-9250-7\">10.1007/s00453-008-9250-7</a>"},"doi":"10.1007/s00453-008-9250-7","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:57Z","publication_status":"published","intvolume":"        57","title":"Kinetic Facility Location","year":"2010","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","first_name":"Christiane","last_name":"Lammersen"}],"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-09-04T10:35:36Z","publication":"Algorithmica","issue":"3"},{"language":[{"iso":"eng"}],"doi":"10.1007/s004530010028","author":[{"full_name":"Blömer, J.","last_name":"Blömer","first_name":"J."}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2002","title":"Denesting by Bounded Degree Radicals","intvolume":"        28","publication_status":"published","date_updated":"2023-01-10T13:48:53Z","date_created":"2023-01-10T13:44:28Z","department":[{"_id":"64"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","publication":"Algorithmica","issue":"1","_id":"35857","publisher":"Springer Science and Business Media LLC","page":"2-15","volume":28,"user_id":"23","status":"public","citation":{"apa":"Blömer, J. (2002). Denesting by Bounded Degree Radicals. <i>Algorithmica</i>, <i>28</i>(1), 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>","ieee":"J. Blömer, “Denesting by Bounded Degree Radicals,” <i>Algorithmica</i>, vol. 28, no. 1, pp. 2–15, 2002, doi: <a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","short":"J. Blömer, Algorithmica 28 (2002) 2–15.","chicago":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i> 28, no. 1 (2002): 2–15. <a href=\"https://doi.org/10.1007/s004530010028\">https://doi.org/10.1007/s004530010028</a>.","mla":"Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i>, vol. 28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>.","ama":"Blömer J. Denesting by Bounded Degree Radicals. <i>Algorithmica</i>. 2002;28(1):2-15. doi:<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>","bibtex":"@article{Blömer_2002, title={Denesting by Bounded Degree Radicals}, volume={28}, DOI={<a href=\"https://doi.org/10.1007/s004530010028\">10.1007/s004530010028</a>}, number={1}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Blömer, J.}, year={2002}, pages={2–15} }"}},{"citation":{"ieee":"S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614.","apa":"Govindarajan, S., Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i> (pp. 585–614). <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>","chicago":"Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 585–614, 2000. <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>.","short":"S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.","mla":"Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614, doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>.","bibtex":"@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, year={2000}, pages={585–614} }","ama":"Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>. ; 2000:585-614. doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>"},"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T13:21:02Z","date_updated":"2022-01-06T06:53:55Z","publication_status":"published","author":[{"full_name":"Govindarajan, Sathish","first_name":"Sathish","last_name":"Govindarajan"},{"full_name":"Lukovszki, Tamas","last_name":"Lukovszki","first_name":"Tamas"},{"last_name":"Maheshwari","first_name":"Anil","full_name":"Maheshwari, Anil"},{"last_name":"Zeh","first_name":"Norbert","full_name":"Zeh, Norbert"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2000","title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","status":"public","doi":"10.1007/s00453-005-1197-3","user_id":"15415","_id":"18962","language":[{"iso":"eng"}],"page":"585-614"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-16T11:46:56Z","publication":"Algorithmica","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, 413–27. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” <i>Algorithmica</i>, pp. 413–427, 1996, doi: <a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>.","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1996). Strongly adaptive token distribution. <i>Algorithmica</i>, 413–427. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>","bibtex":"@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>}, journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. <i>Algorithmica</i>. Published online 1996:413-427. doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, pp. 413–27, doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>."},"user_id":"15415","doi":"10.1007/bf01955042","page":"413-427","_id":"16699","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1996","title":"Strongly adaptive token distribution","status":"public","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}]},{"citation":{"short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.","chicago":"Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, 517–42. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>.","apa":"Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>, 517–542. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” <i>Algorithmica</i>, pp. 517–542, 1996.","ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>. 1996:517-542. doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>","bibtex":"@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation on a distributed memory machine}, DOI={<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>}, journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={517–542} }","mla":"Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, pp. 517–42, doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>."},"publication":"Algorithmica","date_created":"2020-04-16T11:50:27Z","department":[{"_id":"63"}],"type":"journal_article","author":[{"last_name":"Karp","first_name":"R. M.","full_name":"Karp, R. M."},{"last_name":"Luby","first_name":"M.","full_name":"Luby, M."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"status":"public","title":"Efficient PRAM simulation on a distributed memory machine","year":"1996","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","_id":"16700","language":[{"iso":"eng"}],"page":"517-542","doi":"10.1007/bf01940878","user_id":"15415"}]