---
_id: '33947'
article_type: original
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031
apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved
Algorithms for Chain-Formation. Theoretical Computer Science, 939,
261–291. https://doi.org/10.1016/j.tcs.2022.10.031
bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031},
journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow,
Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, year={2023}, pages={261–291} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time
and Improved Algorithms for Chain-Formation.” Theoretical Computer Science
939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291,
2023, doi: 10.1016/j.tcs.2022.10.031.'
mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science,
vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031.
short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical
Computer Science 939 (2023) 261–291.
date_created: 2022-10-28T05:11:16Z
date_updated: 2023-01-30T09:20:09Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2022.10.031
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 939'
keyword:
- General Computer Science
- Theoretical Computer Science
language:
- iso: eng
page: 261-291
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation
type: journal_article
user_id: '38705'
volume: 939
year: '2023'
...
---
_id: '34008'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F.
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited
Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) . Vol
253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15'
apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf
der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented
Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.),
Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15
bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023,
place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15},
booktitle={Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik},
author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and
Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and
Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann,
and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , edited
by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz
International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl
– Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.'
ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf
der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility ,” in Proceedings of the 26th International Conference
on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253,
p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.'
mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International
Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar
Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023,
p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.
short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der
Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , Schloss
Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.'
conference:
end_date: 2022-12-15
location: Brussels
name: 26th International Conference on Principles of Distributed Systems (OPODIS)
start_date: 2022-12-13
date_created: 2022-11-04T09:41:30Z
date_updated: 2023-02-15T14:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.OPODIS.2022.15
editor:
- first_name: Eshcar
full_name: Hillel, Eshcar
last_name: Hillel
- first_name: Roberto
full_name: Palmieri, Roberto
last_name: Palmieri
- first_name: Etienne
full_name: Riviére, Etienne
last_name: Riviére
external_id:
arxiv:
- '2206.07567 '
intvolume: ' 253'
language:
- iso: eng
page: 15:1–15:25
place: Brussels
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 'Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) '
publication_identifier:
isbn:
- 978-3-95977-265-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with
Limited Visibility '
type: conference
user_id: '38705'
volume: 253
year: '2023'
...
---
_id: '44077'
author:
- first_name: Marten
full_name: Maack, Marten
last_name: Maack
citation:
ama: Maack M. Online load balancing on uniform machines with limited migration.
Operations Research Letters. 2023;51(3):220-225. doi:10.1016/j.orl.2023.02.013
apa: Maack, M. (2023). Online load balancing on uniform machines with limited migration.
Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013
bibtex: '@article{Maack_2023, title={Online load balancing on uniform machines with
limited migration}, volume={51}, DOI={10.1016/j.orl.2023.02.013},
number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack,
Marten}, year={2023}, pages={220–225} }'
chicago: 'Maack, Marten. “Online Load Balancing on Uniform Machines with Limited
Migration.” Operations Research Letters 51, no. 3 (2023): 220–25. https://doi.org/10.1016/j.orl.2023.02.013.'
ieee: 'M. Maack, “Online load balancing on uniform machines with limited migration,”
Operations Research Letters, vol. 51, no. 3, pp. 220–225, 2023, doi: 10.1016/j.orl.2023.02.013.'
mla: Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.”
Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25,
doi:10.1016/j.orl.2023.02.013.
short: M. Maack, Operations Research Letters 51 (2023) 220–225.
date_created: 2023-04-20T08:59:14Z
date_updated: 2023-04-21T07:53:42Z
department:
- _id: '63'
doi: 10.1016/j.orl.2023.02.013
intvolume: ' 51'
issue: '3'
keyword:
- Applied Mathematics
- Industrial and Manufacturing Engineering
- Management Science and Operations Research
- Software
language:
- iso: eng
page: 220-225
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: Operations Research Letters
publication_identifier:
issn:
- 0167-6377
publisher: Elsevier BV
status: public
title: Online load balancing on uniform machines with limited migration
type: journal_article
user_id: '88252'
volume: 51
year: '2023'
...
---
_id: '44769'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols
for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer
International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1'
apa: Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering
Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science.
Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1
bibtex: '@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying
Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide,
Friedhelm}, year={2023} }'
chicago: 'Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying
Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer
Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.'
ieee: 'J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols
for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham:
Springer International Publishing, 2023.'
mla: Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile
Robots.” Lecture Notes in Computer Science, Springer International Publishing,
2023, doi:10.1007/978-3-031-30448-4_1.
short: 'J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Springer International Publishing, Cham, 2023.'
date_created: 2023-05-11T13:13:45Z
date_updated: 2023-05-11T13:14:43Z
department:
- _id: '63'
doi: 10.1007/978-3-031-30448-4_1
language:
- iso: eng
place: Cham
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031304477'
- '9783031304484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Unifying Gathering Protocols for Swarms of Mobile Robots
type: book_chapter
user_id: '38705'
year: '2023'
...
---
_id: '45580'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
citation:
ama: Castenow J. Local Protocols for Contracting and Expanding Robot Formation
Problems.; 2023. doi:10.17619/UNIPB/1-1750
apa: Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot
Formation Problems. https://doi.org/10.17619/UNIPB/1-1750
bibtex: '@book{Castenow_2023, title={Local Protocols for Contracting and Expanding
Robot Formation Problems}, DOI={10.17619/UNIPB/1-1750},
author={Castenow, Jannik}, year={2023} }'
chicago: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot
Formation Problems, 2023. https://doi.org/10.17619/UNIPB/1-1750.
ieee: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation
Problems. 2023.
mla: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation
Problems. 2023, doi:10.17619/UNIPB/1-1750.
short: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation
Problems, 2023.
date_created: 2023-06-12T13:06:58Z
date_updated: 2023-06-13T07:43:11Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1750
language:
- iso: eng
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Protocols for Contracting and Expanding Robot Formation Problems
type: dissertation
user_id: '38705'
year: '2023'
...
---
_id: '45579'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.;
2023. doi:10.17619/UNIPB/1-1751
apa: Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources.
https://doi.org/10.17619/UNIPB/1-1751
bibtex: '@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous
Resources}, DOI={10.17619/UNIPB/1-1751},
author={Knollmann, Till}, year={2023} }'
chicago: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources,
2023. https://doi.org/10.17619/UNIPB/1-1751.
ieee: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources.
2023.
mla: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources.
2023, doi:10.17619/UNIPB/1-1751.
short: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
date_created: 2023-06-12T13:05:04Z
date_updated: 2023-06-12T21:03:14Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1751
language:
- iso: eng
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Algorithms for Allocating Heterogeneous Resources
type: dissertation
user_id: '39241'
year: '2023'
...
---
_id: '45781'
author:
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.;
2023. doi:10.17619/UNIPB/1-1768
apa: Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling. https://doi.org/10.17619/UNIPB/1-1768
bibtex: '@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling}, DOI={10.17619/UNIPB/1-1768
}, author={Pukrop, Simon}, year={2023} }'
chicago: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768
.
ieee: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023.
mla: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023, doi:10.17619/UNIPB/1-1768
.
short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling,
2023.
date_created: 2023-06-27T05:24:19Z
date_updated: 2023-07-14T09:27:44Z
department:
- _id: '63'
doi: '10.17619/UNIPB/1-1768 '
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '50458'
abstract:
- lang: eng
text: AbstractConsider a set of jobs connected
to a directed acyclic task graph with a fixed source and sink. The edges of this
graph model precedence constraints and the jobs have to be scheduled with respect
to those. We introduce the server cloud scheduling problem, in which the jobs
have to be processed either on a single local machine or on one of infinitely
many cloud machines. For each job, processing times both on the server and in
the cloud are given. Furthermore, for each edge in the task graph, a communication
delay is included in the input and has to be taken into account if one of the
two jobs is scheduled on the server and the other in the cloud. The server processes
jobs sequentially, whereas the cloud can serve as many as needed in parallel,
but induces costs. We consider both makespan and cost minimization. The main results
are an FPTAS for the makespan objective for graphs with a constant source and
sink dividing cut and strong hardness for the case with unit processing times
and delays.
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. Algorithmica.
Published online 2023. doi:10.1007/s00453-023-01189-x
apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling.
Algorithmica. https://doi.org/10.1007/s00453-023-01189-x
bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling},
DOI={10.1007/s00453-023-01189-x},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack,
Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }'
chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server
Cloud Scheduling.” Algorithmica, 2023. https://doi.org/10.1007/s00453-023-01189-x.
ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,”
Algorithmica, 2023, doi: 10.1007/s00453-023-01189-x.'
mla: Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer
Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x.
short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
date_created: 2024-01-11T11:10:53Z
date_updated: 2024-01-11T11:19:33Z
department:
- _id: '63'
doi: 10.1007/s00453-023-01189-x
extern: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Server Cloud Scheduling
type: journal_article
user_id: '44428'
year: '2023'
...
---
_id: '50460'
author:
- first_name: Max A.
full_name: Deppert, Max A.
last_name: Deppert
- first_name: Klaus
full_name: Jansen, Klaus
last_name: Jansen
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Malin
full_name: Rau, Malin
last_name: Rau
citation:
ama: 'Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared
Resources. In: 2023 IEEE International Parallel and Distributed Processing
Symposium (IPDPS). IEEE; 2023. doi:10.1109/ipdps54959.2023.00049'
apa: Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling
with Many Shared Resources. 2023 IEEE International Parallel and Distributed
Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049
bibtex: '@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling
with Many Shared Resources}, DOI={10.1109/ipdps54959.2023.00049},
booktitle={2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack,
Marten and Pukrop, Simon and Rau, Malin}, year={2023} }'
chicago: Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau.
“Scheduling with Many Shared Resources.” In 2023 IEEE International Parallel
and Distributed Processing Symposium (IPDPS). IEEE, 2023. https://doi.org/10.1109/ipdps54959.2023.00049.
ieee: 'M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with
Many Shared Resources,” 2023, doi: 10.1109/ipdps54959.2023.00049.'
mla: Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE
International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2023, doi:10.1109/ipdps54959.2023.00049.
short: 'M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.'
date_created: 2024-01-11T11:30:14Z
date_updated: 2024-01-11T11:31:11Z
department:
- _id: '63'
doi: 10.1109/ipdps54959.2023.00049
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: 2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_status: published
publisher: IEEE
status: public
title: Scheduling with Many Shared Resources
type: conference
user_id: '44428'
year: '2023'
...
---
_id: '29843'
article_number: '104877'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous
Study of the Max-Chain-Formation Problem. Information and Computation.
Published online 2022. doi:10.1016/j.ic.2022.104877
apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2022).
A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information
and Computation, Article 104877. https://doi.org/10.1016/j.ic.2022.104877
bibtex: '@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete
and Continuous Study of the Max-Chain-Formation Problem}, DOI={10.1016/j.ic.2022.104877},
number={104877}, journal={Information and Computation}, publisher={Elsevier BV},
author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, year={2022} }'
chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.”
Information and Computation, 2022. https://doi.org/10.1016/j.ic.2022.104877.
ieee: 'J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete
and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation,
Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.'
mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation
Problem.” Information and Computation, 104877, Elsevier BV, 2022, doi:10.1016/j.ic.2022.104877.
short: J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information
and Computation (2022).
date_created: 2022-02-15T07:38:28Z
date_updated: 2022-02-15T07:41:00Z
department:
- _id: '63'
doi: 10.1016/j.ic.2022.104877
keyword:
- Computational Theory and Mathematics
- Computer Science Applications
- Information Systems
- Theoretical Computer Science
language:
- iso: eng
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier BV
status: public
title: A Discrete and Continuous Study of the Max-Chain-Formation Problem
type: journal_article
user_id: '38705'
year: '2022'
...