---
_id: '33947'
article_type: original
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031
apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved
Algorithms for Chain-Formation. Theoretical Computer Science, 939,
261–291. https://doi.org/10.1016/j.tcs.2022.10.031
bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering
a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031},
journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow,
Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, year={2023}, pages={261–291} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time
and Improved Algorithms for Chain-Formation.” Theoretical Computer Science
939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291,
2023, doi: 10.1016/j.tcs.2022.10.031.'
mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science,
vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031.
short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical
Computer Science 939 (2023) 261–291.
date_created: 2022-10-28T05:11:16Z
date_updated: 2023-01-30T09:20:09Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2022.10.031
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 939'
keyword:
- General Computer Science
- Theoretical Computer Science
language:
- iso: eng
page: 261-291
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
for Chain-Formation
type: journal_article
user_id: '38705'
volume: 939
year: '2023'
...
---
_id: '34008'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F.
A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited
Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) . Vol
253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl
– Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15'
apa: Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf
der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented
Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.),
Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15
bibtex: '@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023,
place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15},
booktitle={Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik},
author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and
Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and
Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann,
and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , edited
by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz
International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl
– Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.'
ieee: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf
der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots
with Limited Visibility ,” in Proceedings of the 26th International Conference
on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253,
p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15.'
mla: Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering
of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International
Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar
Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023,
p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.
short: 'J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der
Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th
International Conference on Principles of Distributed Systems (OPODIS) , Schloss
Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.'
conference:
end_date: 2022-12-15
location: Brussels
name: 26th International Conference on Principles of Distributed Systems (OPODIS)
start_date: 2022-12-13
date_created: 2022-11-04T09:41:30Z
date_updated: 2023-02-15T14:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.OPODIS.2022.15
editor:
- first_name: Eshcar
full_name: Hillel, Eshcar
last_name: Hillel
- first_name: Roberto
full_name: Palmieri, Roberto
last_name: Palmieri
- first_name: Etienne
full_name: Riviére, Etienne
last_name: Riviére
external_id:
arxiv:
- '2206.07567 '
intvolume: ' 253'
language:
- iso: eng
page: 15:1–15:25
place: Brussels
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: 'Proceedings of the 26th International Conference on Principles of Distributed
Systems (OPODIS) '
publication_identifier:
isbn:
- 978-3-95977-265-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl – Leibniz Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with
Limited Visibility '
type: conference
user_id: '38705'
volume: 253
year: '2023'
...
---
_id: '44077'
author:
- first_name: Marten
full_name: Maack, Marten
last_name: Maack
citation:
ama: Maack M. Online load balancing on uniform machines with limited migration.
Operations Research Letters. 2023;51(3):220-225. doi:10.1016/j.orl.2023.02.013
apa: Maack, M. (2023). Online load balancing on uniform machines with limited migration.
Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013
bibtex: '@article{Maack_2023, title={Online load balancing on uniform machines with
limited migration}, volume={51}, DOI={10.1016/j.orl.2023.02.013},
number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack,
Marten}, year={2023}, pages={220–225} }'
chicago: 'Maack, Marten. “Online Load Balancing on Uniform Machines with Limited
Migration.” Operations Research Letters 51, no. 3 (2023): 220–25. https://doi.org/10.1016/j.orl.2023.02.013.'
ieee: 'M. Maack, “Online load balancing on uniform machines with limited migration,”
Operations Research Letters, vol. 51, no. 3, pp. 220–225, 2023, doi: 10.1016/j.orl.2023.02.013.'
mla: Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.”
Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25,
doi:10.1016/j.orl.2023.02.013.
short: M. Maack, Operations Research Letters 51 (2023) 220–225.
date_created: 2023-04-20T08:59:14Z
date_updated: 2023-04-21T07:53:42Z
department:
- _id: '63'
doi: 10.1016/j.orl.2023.02.013
intvolume: ' 51'
issue: '3'
keyword:
- Applied Mathematics
- Industrial and Manufacturing Engineering
- Management Science and Operations Research
- Software
language:
- iso: eng
page: 220-225
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: Operations Research Letters
publication_identifier:
issn:
- 0167-6377
publisher: Elsevier BV
status: public
title: Online load balancing on uniform machines with limited migration
type: journal_article
user_id: '88252'
volume: 51
year: '2023'
...
---
_id: '44769'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols
for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer
International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1'
apa: Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering
Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science.
Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1
bibtex: '@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying
Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1},
booktitle={Lecture Notes in Computer Science}, publisher={Springer International
Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide,
Friedhelm}, year={2023} }'
chicago: 'Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying
Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer
Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.'
ieee: 'J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols
for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham:
Springer International Publishing, 2023.'
mla: Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile
Robots.” Lecture Notes in Computer Science, Springer International Publishing,
2023, doi:10.1007/978-3-031-30448-4_1.
short: 'J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Springer International Publishing, Cham, 2023.'
date_created: 2023-05-11T13:13:45Z
date_updated: 2023-05-11T13:14:43Z
department:
- _id: '63'
doi: 10.1007/978-3-031-30448-4_1
language:
- iso: eng
place: Cham
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783031304477'
- '9783031304484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Unifying Gathering Protocols for Swarms of Mobile Robots
type: book_chapter
user_id: '38705'
year: '2023'
...
---
_id: '45580'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
citation:
ama: Castenow J. Local Protocols for Contracting and Expanding Robot Formation
Problems.; 2023. doi:10.17619/UNIPB/1-1750
apa: Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot
Formation Problems. https://doi.org/10.17619/UNIPB/1-1750
bibtex: '@book{Castenow_2023, title={Local Protocols for Contracting and Expanding
Robot Formation Problems}, DOI={10.17619/UNIPB/1-1750},
author={Castenow, Jannik}, year={2023} }'
chicago: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot
Formation Problems, 2023. https://doi.org/10.17619/UNIPB/1-1750.
ieee: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation
Problems. 2023.
mla: Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation
Problems. 2023, doi:10.17619/UNIPB/1-1750.
short: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation
Problems, 2023.
date_created: 2023-06-12T13:06:58Z
date_updated: 2023-06-13T07:43:11Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1750
language:
- iso: eng
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Protocols for Contracting and Expanding Robot Formation Problems
type: dissertation
user_id: '38705'
year: '2023'
...
---
_id: '45579'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.;
2023. doi:10.17619/UNIPB/1-1751
apa: Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources.
https://doi.org/10.17619/UNIPB/1-1751
bibtex: '@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous
Resources}, DOI={10.17619/UNIPB/1-1751},
author={Knollmann, Till}, year={2023} }'
chicago: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources,
2023. https://doi.org/10.17619/UNIPB/1-1751.
ieee: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources.
2023.
mla: Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources.
2023, doi:10.17619/UNIPB/1-1751.
short: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
date_created: 2023-06-12T13:05:04Z
date_updated: 2023-06-12T21:03:14Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1751
language:
- iso: eng
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Algorithms for Allocating Heterogeneous Resources
type: dissertation
user_id: '39241'
year: '2023'
...
---
_id: '45781'
author:
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.;
2023. doi:10.17619/UNIPB/1-1768
apa: Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling. https://doi.org/10.17619/UNIPB/1-1768
bibtex: '@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling}, DOI={10.17619/UNIPB/1-1768
}, author={Pukrop, Simon}, year={2023} }'
chicago: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768
.
ieee: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023.
mla: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023, doi:10.17619/UNIPB/1-1768
.
short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling,
2023.
date_created: 2023-06-27T05:24:19Z
date_updated: 2023-07-14T09:27:44Z
department:
- _id: '63'
doi: '10.17619/UNIPB/1-1768 '
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '50458'
abstract:
- lang: eng
text: AbstractConsider a set of jobs connected
to a directed acyclic task graph with a fixed source and sink. The edges of this
graph model precedence constraints and the jobs have to be scheduled with respect
to those. We introduce the server cloud scheduling problem, in which the jobs
have to be processed either on a single local machine or on one of infinitely
many cloud machines. For each job, processing times both on the server and in
the cloud are given. Furthermore, for each edge in the task graph, a communication
delay is included in the input and has to be taken into account if one of the
two jobs is scheduled on the server and the other in the cloud. The server processes
jobs sequentially, whereas the cloud can serve as many as needed in parallel,
but induces costs. We consider both makespan and cost minimization. The main results
are an FPTAS for the makespan objective for graphs with a constant source and
sink dividing cut and strong hardness for the case with unit processing times
and delays.
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. Algorithmica.
Published online 2023. doi:10.1007/s00453-023-01189-x
apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling.
Algorithmica. https://doi.org/10.1007/s00453-023-01189-x
bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling},
DOI={10.1007/s00453-023-01189-x},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack,
Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }'
chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server
Cloud Scheduling.” Algorithmica, 2023. https://doi.org/10.1007/s00453-023-01189-x.
ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,”
Algorithmica, 2023, doi: 10.1007/s00453-023-01189-x.'
mla: Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer
Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x.
short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
date_created: 2024-01-11T11:10:53Z
date_updated: 2024-01-11T11:19:33Z
department:
- _id: '63'
doi: 10.1007/s00453-023-01189-x
extern: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Server Cloud Scheduling
type: journal_article
user_id: '44428'
year: '2023'
...
---
_id: '50460'
author:
- first_name: Max A.
full_name: Deppert, Max A.
last_name: Deppert
- first_name: Klaus
full_name: Jansen, Klaus
last_name: Jansen
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Malin
full_name: Rau, Malin
last_name: Rau
citation:
ama: 'Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared
Resources. In: 2023 IEEE International Parallel and Distributed Processing
Symposium (IPDPS). IEEE; 2023. doi:10.1109/ipdps54959.2023.00049'
apa: Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling
with Many Shared Resources. 2023 IEEE International Parallel and Distributed
Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049
bibtex: '@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling
with Many Shared Resources}, DOI={10.1109/ipdps54959.2023.00049},
booktitle={2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack,
Marten and Pukrop, Simon and Rau, Malin}, year={2023} }'
chicago: Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau.
“Scheduling with Many Shared Resources.” In 2023 IEEE International Parallel
and Distributed Processing Symposium (IPDPS). IEEE, 2023. https://doi.org/10.1109/ipdps54959.2023.00049.
ieee: 'M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with
Many Shared Resources,” 2023, doi: 10.1109/ipdps54959.2023.00049.'
mla: Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE
International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2023, doi:10.1109/ipdps54959.2023.00049.
short: 'M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.'
date_created: 2024-01-11T11:30:14Z
date_updated: 2024-01-11T11:31:11Z
department:
- _id: '63'
doi: 10.1109/ipdps54959.2023.00049
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: 2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_status: published
publisher: IEEE
status: public
title: Scheduling with Many Shared Resources
type: conference
user_id: '44428'
year: '2023'
...
---
_id: '29843'
article_number: '104877'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous
Study of the Max-Chain-Formation Problem. Information and Computation.
Published online 2022. doi:10.1016/j.ic.2022.104877
apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2022).
A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information
and Computation, Article 104877. https://doi.org/10.1016/j.ic.2022.104877
bibtex: '@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete
and Continuous Study of the Max-Chain-Formation Problem}, DOI={10.1016/j.ic.2022.104877},
number={104877}, journal={Information and Computation}, publisher={Elsevier BV},
author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, year={2022} }'
chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.”
Information and Computation, 2022. https://doi.org/10.1016/j.ic.2022.104877.
ieee: 'J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete
and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation,
Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.'
mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation
Problem.” Information and Computation, 104877, Elsevier BV, 2022, doi:10.1016/j.ic.2022.104877.
short: J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information
and Computation (2022).
date_created: 2022-02-15T07:38:28Z
date_updated: 2022-02-15T07:41:00Z
department:
- _id: '63'
doi: 10.1016/j.ic.2022.104877
keyword:
- Computational Theory and Mathematics
- Computer Science Applications
- Information Systems
- Theoretical Computer Science
language:
- iso: eng
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier BV
status: public
title: A Discrete and Continuous Study of the Max-Chain-Formation Problem
type: journal_article
user_id: '38705'
year: '2022'
...
---
_id: '31847'
abstract:
- lang: eng
text: "The famous $k$-Server Problem covers plenty of resource allocation scenarios,
and several variations have been studied extensively for decades. However, to
the best of our knowledge, no research has considered the problem if the servers
are not identical and requests can express which specific servers should serve
them. Therefore, we present a new model generalizing the $k$-Server Problem by
*preferences* of the requests and proceed to study it in a uniform metric space
for deterministic online algorithms (the special case of paging).\r\n\r\nIn our
model, requests can either demand to be answered by any server (*general requests*)
or by a specific one (*specific requests*). If only general requests appear, the
instance is one of the original $k$-Server Problem, and a lower bound for the
competitive ratio of $k$ applies. If only specific requests appear, a solution
with a competitive ratio of $1$ becomes trivial since there is no freedom regarding
the servers' movements. Perhaps counter-intuitively, we show that if both kinds
of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic
online algorithms in uniform metrics and present two algorithms. The first one
has an adaptive competitive ratio dependent on the frequency of specific requests.
It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when
only general or only specific requests appear (competitive ratio of $k$ and $1$,
respectively). The second has a fixed close-to-optimal worst-case competitive
ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while
the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n
\ \r\nThe two algorithms differ in only one behavioral rule for each server
that significantly influences the competitive ratio. Each server acting according
to the rule allows approaching the worst-case lower bound, while it implies an
increased lower bound for $k$-Server instances. In other words, there is a trade-off
between performing well against instances of the $k$-Server Problem and instances
containing specific requests. We also show that no deterministic online algorithm
can be optimal for both kinds of instances simultaneously."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
k-Server with Preferences Problem. In: Proceedings of the 34th ACM Symposium
on Parallelism in Algorithms and Architectures. Association for Computing
Machinery; 2022:345-356. doi:10.1145/3490148.3538595'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2022). The k-Server with Preferences Problem. Proceedings of the
34th ACM Symposium on Parallelism in Algorithms and Architectures, 345–356.
https://doi.org/10.1145/3490148.3538595
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022,
title={The k-Server with Preferences Problem}, DOI={10.1145/3490148.3538595},
booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={Association for Computing Machinery}, author={Castenow,
Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer
auf der Heide, Friedhelm}, year={2022}, pages={345–356} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
345–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3490148.3538595.
ieee: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The k-Server with Preferences Problem,” in Proceedings of the 34th
ACM Symposium on Parallelism in Algorithms and Architectures, 2022, pp. 345–356,
doi: 10.1145/3490148.3538595.'
mla: Castenow, Jannik, et al. “The K-Server with Preferences Problem.” Proceedings
of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–56, doi:10.1145/3490148.3538595.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Association for Computing Machinery, 2022, pp. 345–356.'
date_created: 2022-06-10T09:06:42Z
date_updated: 2022-08-02T08:07:30Z
department:
- _id: '63'
doi: 10.1145/3490148.3538595
external_id:
arxiv:
- '2205.11102'
keyword:
- K-Server Problem
- Heterogeneity
- Online Caching
language:
- iso: eng
page: 345-356
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450391467'
publisher: Association for Computing Machinery
status: public
title: The k-Server with Preferences Problem
type: conference
user_id: '39241'
year: '2022'
...
---
_id: '34040'
abstract:
- lang: eng
text: "Consider the practical goal of making a desired action profile played,\r\n\r\nwhen
the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications
include motivating people\r\n\r\nto choose the closest school, the closest subway
station, or to coordinate\r\n\r\non a communication protocol or an investment
strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing
this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired
mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies
do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually
rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto
zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our
adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly.
The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we
also prove that our adjustment minimises \r\n\r\nthe general transfer among all
such adjustments, counting the total subsidising and taxation."
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Marcin
full_name: Dziubiński, Marcin
last_name: Dziubiński
citation:
ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment.
In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64'
apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap
Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational
and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64},
booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence}, publisher={International Joint Conferences on Artificial Intelligence
Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt,
Luc}, year={2022} }'
chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and
Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences
on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64.
ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,”
in Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.'
mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap
Adjustment.” Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences
on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
short: 'G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence Organization, 2022.'
conference:
end_date: 2022-07-29
location: Vienna
name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2022-07-23
date_created: 2022-11-08T16:53:31Z
date_updated: 2022-11-08T17:34:36Z
department:
- _id: '63'
- _id: '541'
doi: 10.24963/ijcai.2022/64
editor:
- first_name: Luc
full_name: De Raedt, Luc
last_name: De Raedt
keyword:
- adjustment
- strictly dominant
- fairness
- individually rational
- transfer
- tax
- subsidy
language:
- iso: eng
main_file_link:
- url: https://www.ijcai.org/proceedings/2022/64
publication: Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Fair, Individually Rational and Cheap Adjustment
type: conference
user_id: '83983'
year: '2022'
...
---
_id: '33085'
author:
- first_name: Leah
full_name: Epstein, Leah
last_name: Epstein
- first_name: Alexandra
full_name: Lassota, Alexandra
last_name: Lassota
- first_name: Asaf
full_name: Levin, Asaf
last_name: Levin
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Lars
full_name: Rohwedder, Lars
last_name: Rohwedder
citation:
ama: 'Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained
Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference). Vol 219. LIPIcs. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:10.4230/LIPIcs.STACS.2022.28'
apa: Epstein, L., Lassota, A., Levin, A., Maack, M., & Rohwedder, L. (2022).
Cardinality Constrained Scheduling in Online Models. In P. Berenbrink & B.
Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
(Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.STACS.2022.28
bibtex: '@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs},
title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={10.4230/LIPIcs.STACS.2022.28},
booktitle={39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss
Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota,
Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink,
Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs}
}'
chicago: Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder.
“Cardinality Constrained Scheduling in Online Models.” In 39th International
Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18,
2022, Marseille, France (Virtual Conference), edited by Petra Berenbrink and
Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2022. https://doi.org/10.4230/LIPIcs.STACS.2022.28.
ieee: 'L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality
Constrained Scheduling in Online Models,” in 39th International Symposium on
Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille,
France (Virtual Conference), 2022, vol. 219, p. 28:1–28:15, doi: 10.4230/LIPIcs.STACS.2022.28.'
mla: Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.”
39th International Symposium on Theoretical Aspects of Computer Science, STACS
2022, March 15-18, 2022, Marseille, France (Virtual Conference), edited by
Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 28:1–28:15, doi:10.4230/LIPIcs.STACS.2022.28.
short: 'L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink,
B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer
Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference),
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.'
date_created: 2022-08-23T08:10:36Z
date_updated: 2022-11-08T16:34:32Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2022.28
editor:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Benjamin
full_name: Monmege, Benjamin
last_name: Monmege
intvolume: ' 219'
language:
- iso: eng
page: 28:1–28:15
project:
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 39th International Symposium on Theoretical Aspects of Computer Science,
STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Cardinality Constrained Scheduling in Online Models
type: conference
user_id: '88252'
volume: 219
year: '2022'
...
---
_id: '33491'
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Anna Rodriguez
full_name: Rasmussen, Anna Rodriguez
last_name: Rasmussen
citation:
ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval,
Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg
E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77'
apa: Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik,
G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium
on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol.
244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77
bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244},
DOI={10.4230/LIPIcs.ESA.2022.77},
booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez},
editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
year={2022}, pages={77:1–77:13}, collection={LIPIcs} }'
chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling.” In 30th
Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam,
Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz
Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.ESA.2022.77.
ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for
Interval, Resource Restricted, and Low Rank Scheduling,” in 30th Annual European
Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany,
2022, vol. 244, p. 77:1–77:13, doi: 10.4230/LIPIcs.ESA.2022.77.'
mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource
Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms,
ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik
et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p.
77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg,
G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 77:1–77:13.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
full_name: Chechik, Shiri
last_name: Chechik
- first_name: Gonzalo
full_name: Navarro, Gonzalo
last_name: Navarro
- first_name: Eva
full_name: Rotenberg, Eva
last_name: Rotenberg
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
intvolume: ' 244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '31479'
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
Insertion of an Edge. Algorithmica. Published online 2022. doi:10.1007/s00453-022-00978-0
apa: Baswana, S., Gupta, S., & Knollmann, T. (2022). Mincut Sensitivity Data
Structures for the Insertion of an Edge. Algorithmica. https://doi.org/10.1007/s00453-022-00978-0
bibtex: '@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures
for the Insertion of an Edge}, DOI={10.1007/s00453-022-00978-0},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana,
Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }'
chicago: Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” Algorithmica, 2022. https://doi.org/10.1007/s00453-022-00978-0.
ieee: 'S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.'
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” Algorithmica, Springer Science and Business Media LLC, 2022,
doi:10.1007/s00453-022-00978-0.
short: S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
date_created: 2022-05-27T10:09:24Z
date_updated: 2022-05-27T10:14:27Z
department:
- _id: '63'
doi: 10.1007/s00453-022-00978-0
genbank:
- tillk
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: journal_article
user_id: '39241'
year: '2022'
...
---
_id: '29872'
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: 'Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: Approximation
and Online Algorithms. Springer International Publishing; 2022. doi:10.1007/978-3-030-92702-8_10'
apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2022). Server Cloud Scheduling.
In Approximation and Online Algorithms. Springer International Publishing.
https://doi.org/10.1007/978-3-030-92702-8_10
bibtex: '@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server
Cloud Scheduling}, DOI={10.1007/978-3-030-92702-8_10},
booktitle={Approximation and Online Algorithms}, publisher={Springer International
Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop,
Simon}, year={2022} }'
chicago: 'Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server
Cloud Scheduling.” In Approximation and Online Algorithms. Cham: Springer
International Publishing, 2022. https://doi.org/10.1007/978-3-030-92702-8_10.'
ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,”
in Approximation and Online Algorithms, Cham: Springer International Publishing,
2022.'
mla: Maack, Marten, et al. “Server Cloud Scheduling.” Approximation and Online
Algorithms, Springer International Publishing, 2022, doi:10.1007/978-3-030-92702-8_10.
short: 'M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online
Algorithms, Springer International Publishing, Cham, 2022.'
date_created: 2022-02-18T09:31:54Z
date_updated: 2022-09-27T15:03:13Z
department:
- _id: '63'
doi: 10.1007/978-3-030-92702-8_10
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: Approximation and Online Algorithms
publication_identifier:
isbn:
- '9783030927011'
- '9783030927028'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Server Cloud Scheduling
type: book_chapter
user_id: '44428'
year: '2022'
...
---
_id: '21096'
abstract:
- lang: eng
text: While many research in distributed computing has covered solutions for self-stabilizing
computing and topologies, there is far less work on self-stabilization for distributed
data structures. However, when peers in peer-to-peer networks crash, a distributed
data structure may not remain intact. We present a self-stabilizing protocol for
a distributed data structure called the Hashed Patricia Trie (Kniesburges and
Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The
data structure has many applications while offering low overhead and efficient
operations when embedded on top of a Distributed Hash Table. Especially, longest
prefix matching for x can be done in O(log |x|) hash table read accesses. We show
how to maintain the structure in a self-stabilizing way, while assuring a low
overhead in a legal state and an asymptotically optimal memory demand of O(d)
bits, where d is the number of bits needed for storing all keys.
article_number: '104697'
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information
and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697
apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia
Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697
bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia
Trie}, DOI={10.1016/j.ic.2021.104697},
number={104697}, journal={Information and Computation}, author={Knollmann, Till
and Scheideler, Christian}, year={2022} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697.
ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,”
Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.'
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
short: T. Knollmann, C. Scheideler, Information and Computation (2022).
date_created: 2021-01-29T09:39:40Z
date_updated: 2023-03-27T07:56:48Z
department:
- _id: '63'
- _id: '79'
doi: 10.1016/j.ic.2021.104697
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: A self-stabilizing Hashed Patricia Trie
type: journal_article
user_id: '15504'
year: '2022'
...
---
_id: '23730'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Jonas
full_name: Harbig, Jonas
id: '47213'
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
a Euclidean Closed Chain of Robots in Linear Time. In: Gasieniec L, Klasing R,
Radzik T, eds. Proceedings of the 17th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks (ALGOSENSORS). Vol 12961. LNCS.
Springer; 2021:29-44. doi:10.1007/978-3-030-89240-1_3'
apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2021). Gathering a Euclidean Closed Chain of Robots in Linear Time. In L.
Gasieniec, R. Klasing, & T. Radzik (Eds.), Proceedings of the 17th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)
(Vol. 12961, pp. 29–44). Springer. https://doi.org/10.1007/978-3-030-89240-1_3
bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2021,
series={LNCS}, title={Gathering a Euclidean Closed Chain of Robots in Linear Time},
volume={12961}, DOI={10.1007/978-3-030-89240-1_3},
booktitle={Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Castenow,
Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, editor={Gasieniec, Leszek and Klasing, Ralf and Radzik, Tomasz},
year={2021}, pages={29–44}, collection={LNCS} }'
chicago: Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time.”
In Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec, Ralf
Klasing, and Tomasz Radzik, 12961:29–44. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-89240-1_3.
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Gathering a Euclidean Closed Chain of Robots in Linear Time,” in Proceedings
of the 17th International Symposium on Algorithms and Experiments for Wireless
Sensor Networks (ALGOSENSORS), Lissabon, 2021, vol. 12961, pp. 29–44, doi:
10.1007/978-3-030-89240-1_3.'
mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
Time.” Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS), edited by Leszek Gasieniec et
al., vol. 12961, Springer, 2021, pp. 29–44, doi:10.1007/978-3-030-89240-1_3.
short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
L. Gasieniec, R. Klasing, T. Radzik (Eds.), Proceedings of the 17th International
Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS),
Springer, 2021, pp. 29–44.'
conference:
end_date: 2021-09-10
location: Lissabon
name: 17th International Symposium on Algorithms and Experiments for Wireless Sensor
Networks (ALGOSENSORS) 2021
start_date: 2021-09-09
date_created: 2021-09-03T09:01:25Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1007/978-3-030-89240-1_3
editor:
- first_name: Leszek
full_name: Gasieniec, Leszek
last_name: Gasieniec
- first_name: Ralf
full_name: Klasing, Ralf
last_name: Klasing
- first_name: Tomasz
full_name: Radzik, Tomasz
last_name: Radzik
external_id:
arxiv:
- '2010.04424'
intvolume: ' 12961'
language:
- iso: eng
page: 29 - 44
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Proceedings of the 17th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks (ALGOSENSORS)
publication_status: published
publisher: Springer
series_title: LNCS
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time
type: conference
user_id: '38705'
volume: 12961
year: '2021'
...
---
_id: '23779'
abstract:
- lang: ger
text: "Produktentstehung (PE) bezieht sich auf den Prozess der Planung und Entwicklung
eines Produkts sowie der damit verbundenen Dienstleistungen von der ersten Idee
bis zur Herstellung und zum Vertrieb. Während dieses Prozesses gibt es zahlreiche
Aufgaben, die von menschlichem Fachwissen abhängen und typischerweise von erfahrenen
Experten übernommen werden. Da sich das Feld der Künstlichen Intelligenz (KI)
immer weiterentwickelt und seinen Weg in den Fertigungssektor findet, gibt es
viele Möglichkeiten für eine Anwendung von KI, um bei der Lösung der oben genannten
Aufgaben zu helfen. In diesem Paper geben wir einen umfassenden Überblick über
den aktuellen Stand der Technik des Einsatzes von KI in der PE. \r\nIm Detail
analysieren wir 40 bestehende Surveys zu KI in der PE und 94 Case Studies, um
herauszufinden, welche Bereiche der PE von der aktuellen Forschung in diesem Bereich
vorrangig adressiert werden, wie ausgereift die diskutierten KI-Methoden sind
und inwieweit datenzentrierte Ansätze in der aktuellen Forschung genutzt werden."
- lang: eng
text: "Product Creation (PC) refers to the process of planning and developing a
product as well as related services from the initial idea until manufacturing
and distribution. Throughout this process, there are numerous tasks that depend
on human expertise and are typically undertaken by experienced practitioners.
As the field of Artificial Intelligence (AI) continues to evolve and finds its
way into the manufacturing sector, there exist many possibilities for an application
of AI in order to assist in solving aforementioned tasks. In this work, we provide
a comprehensive overview of the current state of the art of the use of AI in PC.
\r\nIn detail, we analyze 40 existing surveys on AI in PC and 94 case studies
in order to find out which areas of PC are primarily addressed by current research
in this field, how mature the discussed AI methods are, and to which extent data-centric
approaches are utilized in current research."
author:
- first_name: Ruslan
full_name: Bernijazov, Ruslan
last_name: Bernijazov
- first_name: Alexander
full_name: Dicks, Alexander
last_name: Dicks
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
- first_name: Marc
full_name: Foullois, Marc
last_name: Foullois
- first_name: Jonas Manuel
full_name: Hanselle, Jonas Manuel
id: '43980'
last_name: Hanselle
orcid: 0000-0002-1231-4985
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Gökce
full_name: Karakaya, Gökce
last_name: Karakaya
- first_name: Patrick
full_name: Ködding, Patrick
id: '45402'
last_name: Ködding
- first_name: Volker
full_name: Lohweg, Volker
last_name: Lohweg
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Melina
full_name: Panzner, Melina
last_name: Panzner
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
citation:
ama: 'Bernijazov R, Dicks A, Dumitrescu R, et al. A Meta-Review on Artificial Intelligence
in Product Creation. In: Proceedings of the 30th International Joint Conference
on Artificial Intelligence (IJCAI-21). ; 2021.'
apa: Bernijazov, R., Dicks, A., Dumitrescu, R., Foullois, M., Hanselle, J. M., Hüllermeier,
E., Karakaya, G., Ködding, P., Lohweg, V., Malatyali, M., Meyer auf der Heide,
F., Panzner, M., & Soltenborn, C. (2021). A Meta-Review on Artificial Intelligence
in Product Creation. Proceedings of the 30th International Joint Conference
on Artificial Intelligence (IJCAI-21). 30th International Joint Conference
on Artificial Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal,
Kanada.
bibtex: '@inproceedings{Bernijazov_Dicks_Dumitrescu_Foullois_Hanselle_Hüllermeier_Karakaya_Ködding_Lohweg_Malatyali_et
al._2021, title={A Meta-Review on Artificial Intelligence in Product Creation},
booktitle={Proceedings of the 30th International Joint Conference on Artificial
Intelligence (IJCAI-21)}, author={Bernijazov, Ruslan and Dicks, Alexander and
Dumitrescu, Roman and Foullois, Marc and Hanselle, Jonas Manuel and Hüllermeier,
Eyke and Karakaya, Gökce and Ködding, Patrick and Lohweg, Volker and Malatyali,
Manuel and et al.}, year={2021} }'
chicago: Bernijazov, Ruslan, Alexander Dicks, Roman Dumitrescu, Marc Foullois, Jonas
Manuel Hanselle, Eyke Hüllermeier, Gökce Karakaya, et al. “A Meta-Review on Artificial
Intelligence in Product Creation.” In Proceedings of the 30th International
Joint Conference on Artificial Intelligence (IJCAI-21), 2021.
ieee: R. Bernijazov et al., “A Meta-Review on Artificial Intelligence in Product
Creation,” presented at the 30th International Joint Conference on Artificial
Intelligence (IJCAI 2021) - Workshop “AI and Product Design,” Montreal, Kanada,
2021.
mla: Bernijazov, Ruslan, et al. “A Meta-Review on Artificial Intelligence in Product
Creation.” Proceedings of the 30th International Joint Conference on Artificial
Intelligence (IJCAI-21), 2021.
short: 'R. Bernijazov, A. Dicks, R. Dumitrescu, M. Foullois, J.M. Hanselle, E. Hüllermeier,
G. Karakaya, P. Ködding, V. Lohweg, M. Malatyali, F. Meyer auf der Heide, M. Panzner,
C. Soltenborn, in: Proceedings of the 30th International Joint Conference on Artificial
Intelligence (IJCAI-21), 2021.'
conference:
end_date: 2021-08-26
location: Montreal, Kanada
name: 30th International Joint Conference on Artificial Intelligence (IJCAI 2021)
- Workshop "AI and Product Design"
start_date: 2021-08-19
date_created: 2021-09-06T08:23:45Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
- _id: '563'
- _id: '355'
- _id: '241'
keyword:
- Artificial Intelligence Product Creation Literature Review
language:
- iso: eng
main_file_link:
- url: https://www.hsu-hh.de/imb/wp-content/uploads/sites/677/2021/08/A-Meta-Review-on-Artificial-Intelligence-in-Product-Creation.pdf
publication: Proceedings of the 30th International Joint Conference on Artificial
Intelligence (IJCAI-21)
publication_status: epub_ahead
quality_controlled: '1'
status: public
title: A Meta-Review on Artificial Intelligence in Product Creation
type: conference
user_id: '15415'
year: '2021'
...
---
_id: '20683'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
id: '41265'
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8
apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021).
Managing Multiple Mobile Resources. Theory of Computing Systems, 65,
943–984. https://doi.org/10.1007/s00224-020-10023-8
bibtex: '@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing
Multiple Mobile Resources}, volume={65}, DOI={10.1007/s00224-020-10023-8},
journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann,
Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984}
}'
chicago: 'Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “Managing Multiple Mobile Resources.” Theory of Computing Systems
65 (2021): 943–984. https://doi.org/10.1007/s00224-020-10023-8.'
ieee: 'B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984,
2021, doi: 10.1007/s00224-020-10023-8.'
mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of
Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
short: B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of
Computing Systems 65 (2021) 943–984.
date_created: 2020-12-08T08:40:10Z
date_updated: 2022-01-06T06:54:31Z
department:
- _id: '63'
doi: 10.1007/s00224-020-10023-8
intvolume: ' 65'
language:
- iso: eng
page: 943–984
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_status: published
status: public
title: Managing Multiple Mobile Resources
type: journal_article
user_id: '15415'
volume: 65
year: '2021'
...