---
_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: '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: '45875'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities
and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer
auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20.
doi:10.5281/zenodo.8060372'
apa: Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., & Werthmann,
J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks.
In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets
(Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8060372
bibtex: '@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023,
place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
title={Capabilities and Limitations of Local Strategies in Dynamic Networks},
volume={412}, DOI={10.5281/zenodo.8060372},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten
and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian
and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm
and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023},
pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts}
}'
chicago: 'Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian
Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies
in Dynamic Networks.” In On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der
Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn,
2023. https://doi.org/10.5281/zenodo.8060372.'
ieee: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann,
“Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly
Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.'
mla: Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in
Dynamic Networks.” On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut,
Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.
short: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann,
in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets,
Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.'
date_created: 2023-07-07T06:21:38Z
date_updated: 2023-07-07T06:21:57Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8060372
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: ups
date_created: 2023-07-07T06:20:43Z
date_updated: 2023-07-07T06:20:43Z
file_id: '45876'
file_name: A1-Chapter-SFB-Buch-Final.pdf
file_size: 543715
relation: main_file
file_date_updated: 2023-07-07T06:20:43Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 1--20
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _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)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Capabilities and Limitations of Local Strategies in Dynamic Networks
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45895'
author:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- 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
- first_name: Adrian
full_name: Redder, Adrian
id: '52265'
last_name: Redder
orcid: https://orcid.org/0000-0001-7391-4688
citation:
ama: 'Karl H, Maack M, Meyer auf der Heide F, Pukrop S, Redder A. On-The-Fly Compute
Centers II: Execution of Composed Services in Configurable Compute Centers. In:
Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:183-202.
doi:10.5281/zenodo.8068664'
apa: 'Karl, H., Maack, M., Meyer auf der Heide, F., Pukrop, S., & Redder, A.
(2023). On-The-Fly Compute Centers II: Execution of Composed Services in Configurable
Compute Centers. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth,
& H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services
in dynamic markets (Vol. 412, pp. 183–202). Heinz Nixdorf Institut, Universität
Paderborn. https://doi.org/10.5281/zenodo.8068664'
bibtex: '@inbook{Karl_Maack_Meyer auf der Heide_Pukrop_Redder_2023, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly
Compute Centers II: Execution of Composed Services in Configurable Compute Centers},
volume={412}, DOI={10.5281/zenodo.8068664},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Karl, Holger
and Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon and Redder,
Adrian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner,
Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={183–202},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }'
chicago: 'Karl, Holger, Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop,
and Adrian Redder. “On-The-Fly Compute Centers II: Execution of Composed Services
in Configurable Compute Centers.” In On-The-Fly Computing -- Individualized
IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer
auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:183–202.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut,
Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068664.'
ieee: 'H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, and A. Redder, “On-The-Fly
Compute Centers II: Execution of Composed Services in Configurable Compute Centers,”
in On-The-Fly Computing -- Individualized IT-services in dynamic markets,
vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and
H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023,
pp. 183–202.'
mla: 'Karl, Holger, et al. “On-The-Fly Compute Centers II: Execution of Composed
Services in Configurable Compute Centers.” On-The-Fly Computing -- Individualized
IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol.
412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202, doi:10.5281/zenodo.8068664.'
short: 'H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, A. Redder, in: C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.),
On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf
Institut, Universität Paderborn, Paderborn, 2023, pp. 183–202.'
date_created: 2023-07-07T08:24:28Z
date_updated: 2023-07-07T11:16:53Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068664
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T08:24:20Z
date_updated: 2023-07-07T11:16:52Z
file_id: '45896'
file_name: C4-Chapter-SFB-Buch-Final.pdf
file_size: 1803186
relation: main_file
file_date_updated: 2023-07-07T11:16:52Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 183-202
place: Paderborn
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: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'On-The-Fly Compute Centers II: Execution of Composed Services in Configurable
Compute Centers'
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45863'
abstract:
- lang: eng
text: "In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT
services that describes an approach to the provision of such services\r\nthat
was novel at that time and, to a large extent, remains so today:\r\n„Our vision
of on-the-fly computing is that of IT services individually and\r\nautomatically
configured and brought to execution from flexibly combinable\r\nservices traded
on markets. At the same time, we aim at organizing\r\nmarkets whose participants
maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver
the last 12 years, we have developed methods and techniques to\r\naddress problems
critical to the convenient, efficient, and secure use of\r\non-the-fly computing.
Among other things, we have made the description\r\nof services more convenient
by allowing natural language input,\r\nincreased the quality of configured services
through (natural language)\r\ninteraction and more efficient configuration processes
and analysis\r\nprocedures, made the quality of (the products of) providers in
the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource
efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes
and an integrated treatment of service description and\r\nconfiguration. We have
also developed network infrastructures that have\r\na high degree of adaptivity,
scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees
of anonymity and security for market\r\nparticipants and their products and services.\r\nTo
demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented
a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF
market. We illustrated the approach using\r\na cutting-edge application scenario
– automated machine learning (AutoML).\r\nFinally, we have been pushing our work
for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the
expertise gained\r\nin the SFB in events with industry partners as well as transfer
projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand
economists with research interests such as computer networks and\r\ndistributed
algorithms, security and cryptography, software engineering\r\nand verification,
configuration and machine learning, computer engineering\r\nand HPC, microeconomics
and game theory, business informatics\r\nand management have successfully collaborated
here."
alternative_title:
- Collaborative Research Centre 901 (2011 – 2023)
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Heinz
Nixdorf Institut, Universität Paderborn; 2023. doi:10.17619/UNIPB/1-1797
apa: Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., & Wehrheim,
H. (2023). On-The-Fly Computing -- Individualized IT-services in dynamic markets
(Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1797
bibtex: '@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly
Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={10.17619/UNIPB/1-1797}, publisher={Heinz
Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer
auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim,
Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts}
}'
chicago: 'Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning
Wachsmuth, and Heike Wehrheim. On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.17619/UNIPB/1-1797.'
ieee: 'C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim,
On-The-Fly Computing -- Individualized IT-services in dynamic markets,
vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.'
mla: Haake, Claus-Jochen, et al. On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:10.17619/UNIPB/1-1797.
short: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim,
On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf
Institut, Universität Paderborn, Paderborn, 2023.
date_created: 2023-07-05T07:16:51Z
date_updated: 2023-08-29T06:44:36Z
ddc:
- '000'
department:
- _id: '7'
doi: 10.17619/UNIPB/1-1797
file:
- access_level: open_access
content_type: application/pdf
creator: ups
date_created: 2023-07-05T07:15:55Z
date_updated: 2023-07-05T07:19:14Z
file_id: '45864'
file_name: SFB-Buch-Final.pdf
file_size: 15480050
relation: main_file
file_date_updated: 2023-07-05T07:19:14Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: '247'
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '7'
grant_number: '160364472'
name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
(Subproject A3)'
- _id: '8'
grant_number: '160364472'
name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
(Subproject A4)'
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '10'
grant_number: '160364472'
name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '14'
grant_number: '160364472'
name: 'SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen
(Subproject C2)'
- _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)'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '84'
name: 'SFB 901 - T2: SFB 901 -Subproject T2'
publication_identifier:
unknown:
- 978-3-947647-31-6
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: On-The-Fly Computing -- Individualized IT-services in dynamic markets
type: book
user_id: '477'
volume: 412
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: '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: '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: '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'
...
---
_id: '22510'
abstract:
- lang: eng
text: 'Over the past decades, the Gathering problem, which asks to gather a group
of robots in finite time given some restrictions, has been intensively studied.
In this paper, we are given a group of n autonomous, dimensionless, deterministic,
and anonymous robots, with bounded viewing range. Assuming a continuous time model,
the goal is to gather these robots into one point in finite time. We introduce
a simple convergence criterion that defines a new class of algorithms which perform
gathering in O(nd) time, where d is the diameter of the initial robot configuration.
We show that some gathering algorithms in the literature belong to this class
and propose two new algorithms that belong to this class and have quadratic running
time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center
algorithm (S-GTRC). We prove that the latter can perform gathering without collision
by using a slightly more complex robot model: non oblivious, chiral, and luminous
(i.e. robots have observable external memory, as in [8]). We also consider a variant
of the Gathering problem, the Near-Gathering problem, in which robots must get
close to each other without colliding. We show that S-GTRC solves the Near-Gathering
problem in quadratic time and assumes a weaker robot model than the one assumed
in the current state-of-the-art.'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy
for collisionless gathering. Theoretical Computer Science. 2021;852:41-60.
doi:10.1016/j.tcs.2020.10.037
apa: Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2021).
A continuous strategy for collisionless gathering. Theoretical Computer Science,
852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037
bibtex: '@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous
strategy for collisionless gathering}, volume={852}, DOI={10.1016/j.tcs.2020.10.037},
journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60}
}'
chicago: 'Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel
Podlipyan. “A Continuous Strategy for Collisionless Gathering.” Theoretical
Computer Science 852 (2021): 41–60. https://doi.org/10.1016/j.tcs.2020.10.037.'
ieee: S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous
strategy for collisionless gathering,” Theoretical Computer Science, vol.
852, pp. 41–60, 2021.
mla: Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” Theoretical
Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
short: S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer
Science 852 (2021) 41–60.
date_created: 2021-06-28T09:24:15Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.10.037
intvolume: ' 852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 41-60
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: A continuous strategy for collisionless gathering
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_id: '22511'
abstract:
- lang: eng
text: "In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center
algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile
robots with limited viewing range in the plane. Remarquably, this algorithm exploits
the fact that during its execution, many collisions of robots occur. Such collisions
are interpreted as a success because it is assumed that such collided robots behave
the same from now on. This is acceptable under the assumption that each robot
is represented by a single point. Otherwise, collisions should be avoided. In
this paper, we consider a continuous Go-To-The-Center algorithm in which the robots
continuously observe the positions of their neighbors and adapt their speed (assuming
a speed limit) and direction. Our first results are time bounds of O(n2) for gathering
in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution
is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center
considering only the neighbors of a robot with respect to the Gabriel subgraph
of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that
this modification still correctly executes gathering in one and two dimensions,
with the same time bounds as above. Simulations exhibit a severe difference of
the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms:
Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm,
typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center
algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center
algorithm for one dimension. In two-dimensional Euclidean space, we conjecture
that the “collisionless property” holds for almost every initial configuration.
We support our conjecture with measurements obtained from the simulation where
robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph
of the visibility graph on the gathering of mobile autonomous robots. Theoretical
Computer Science. 2021;852:29-40. doi:10.1016/j.tcs.2020.11.009
apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of
the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009
bibtex: '@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the
Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots}, volume={852}, DOI={10.1016/j.tcs.2020.11.009},
journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der
Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }'
chicago: 'Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The
Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile
Autonomous Robots.” Theoretical Computer Science 852 (2021): 29–40. https://doi.org/10.1016/j.tcs.2020.11.009.'
ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel
subgraph of the visibility graph on the gathering of mobile autonomous robots,”
Theoretical Computer Science, vol. 852, pp. 29–40, 2021.
mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph
on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science,
vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
short: S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science
852 (2021) 29–40.
date_created: 2021-06-28T09:34:45Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.11.009
intvolume: ' 852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 29-40
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: The impact of the Gabriel subgraph of the visibility graph on the gathering
of mobile autonomous robots
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_id: '26986'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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, Götte T, Knollmann T, Meyer auf der Heide F. The Max-Line-Formation
Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller
EM, Schmid S, eds. Proceedings of the 23rd International Symposium on Stabilization,
Safety, and Security of Distributed Systems, SSS 2021. Vol 13046. LNCS. Springer;
2021:289-304. doi:10.1007/978-3-030-91081-5_19'
apa: Castenow, J., Götte, T., Knollmann, T., & Meyer auf der Heide, F. (2021).
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.
In C. Johnen, E. M. Schiller, & S. Schmid (Eds.), Proceedings of the 23rd
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer. https://doi.org/10.1007/978-3-030-91081-5_19
bibtex: '@inproceedings{Castenow_Götte_Knollmann_Meyer auf der Heide_2021, series={LNCS},
title={The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation},
volume={13046}, DOI={10.1007/978-3-030-91081-5_19},
booktitle={Proceedings of the 23rd International Symposium on Stabilization, Safety,
and Security of Distributed Systems, SSS 2021}, publisher={Springer}, author={Castenow,
Jannik and Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm},
editor={Johnen, C. and Schiller, E.M. and Schmid, S.}, year={2021}, pages={289–304},
collection={LNCS} }'
chicago: Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf
der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and
Chain-Formation.” In Proceedings of the 23rd International Symposium on Stabilization,
Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen,
E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5_19.
ieee: 'J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation
Problem – And New Insights for Gathering and Chain-Formation,” in Proceedings
of the 23rd International Symposium on Stabilization, Safety, and Security of
Distributed Systems, SSS 2021, Online, 2021, vol. 13046, pp. 289–304, doi:
10.1007/978-3-030-91081-5_19.'
mla: Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights
for Gathering and Chain-Formation.” Proceedings of the 23rd International Symposium
on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited
by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19.
short: 'J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen,
E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium
on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer,
2021, pp. 289–304.'
conference:
end_date: 2021-11-20
location: Online
name: 23rd International Symposium on Stabilization, Safety, and Security of Distributed
Systems
start_date: 2021-11-17
date_created: 2021-10-28T07:01:30Z
date_updated: 2022-01-07T15:24:10Z
department:
- _id: '63'
doi: 10.1007/978-3-030-91081-5_19
editor:
- first_name: C.
full_name: Johnen, C.
last_name: Johnen
- first_name: E.M.
full_name: Schiller, E.M.
last_name: Schiller
- first_name: S.
full_name: Schmid, S.
last_name: Schmid
external_id:
arxiv:
- '2109.11856'
intvolume: ' 13046'
language:
- iso: eng
page: '289-304 '
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Proceedings of the 23rd International Symposium on Stabilization, Safety,
and Security of Distributed Systems, SSS 2021
publication_status: published
publisher: Springer
series_title: LNCS
status: public
title: The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
type: conference
user_id: '38705'
volume: 13046
year: '2021'
...
---
_id: '27778'
abstract:
- lang: eng
text: "Consider a set of jobs connected to a directed acyclic task graph with a\r\nfixed
source and sink. The edges of this graph model precedence constraints and\r\nthe
jobs have to be scheduled with respect to those. We introduce the Server\r\nCloud
Scheduling problem, in which the jobs have to be processed either on a\r\nsingle
local machine or on one of many cloud machines. Both the source and the\r\nsink
have to be scheduled on the local machine. For each job, processing times\r\nboth
on the server and in the cloud are given. Furthermore, for each edge in\r\nthe
task graph, a communication delay is included in the input and has to be\r\ntaken
into account if one of the two jobs is scheduled on the server, the other\r\nin
the cloud. The server can process jobs sequentially, whereas the cloud can\r\nserve
as many as needed in parallel, but induces costs. We consider both\r\nmakespan
and cost minimization. The main results are an FPTAS with respect for\r\nthe makespan
objective for a fairly general case and strong hardness for the\r\ncase 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. Full Version -- Server Cloud Scheduling.
arXiv:210802109. Published online 2021.
apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2021). Full Version --
Server Cloud Scheduling. In arXiv:2108.02109.
bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2021, title={Full Version --
Server Cloud Scheduling}, journal={arXiv:2108.02109}, author={Maack, Marten and
Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2021} }'
chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version
-- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.
ieee: M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud
Scheduling,” arXiv:2108.02109. 2021.
mla: Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109,
2021.
short: M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).
date_created: 2021-11-24T13:23:58Z
date_updated: 2022-09-27T15:03:19Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
publication: arXiv:2108.02109
status: public
title: Full Version -- Server Cloud Scheduling
type: preprint
user_id: '44428'
year: '2021'
...
---
_id: '19899'
abstract:
- lang: eng
text: "Most existing robot formation problems seek a target formation of a certain\r\nminimal
and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation
problem. In this work, we study formation problems that\r\ntry to reach a maximal
structure, supporting for example an efficient\r\ncoverage in exploration scenarios.
A recent example is the NASA Shapeshifter\r\nproject, which describes how the
robots form a relay chain along which gathered\r\ndata from extraterrestrial cave
explorations may be sent to a home base.\r\n As a first step towards understanding
such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem,
where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting
chain and must form a connected,\r\nstraight line of maximal length connecting
its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a
continuous time model. In the\r\ndiscrete case, we give a complete analysis if
all robots are initially\r\ncollinear, showing that the worst-case time to reach
an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot
\\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$.
If one endpoint of the chain remains stationary, this result\r\ncan be extended
to the non-collinear case. If both endpoints move, we identify\r\na family of
instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy
with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime
similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect
of the strategy: slowing down the endpoints while all\r\nother robots move at
full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in
the discrete model."
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 – Slow Down to Speed Up. In: Devismes S,
Mittal N, eds. Stabilization, Safety, and Security of Distributed Systems -
22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020,
Proceedings. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer;
2020:65-80. doi:10.1007/978-3-030-64348-5_6'
apa: Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020).
A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down
to Speed Up. In S. Devismes & N. Mittal (Eds.), Stabilization, Safety,
and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
Austin, Texas, USA, November 18-21, 2020, Proceedings (Vol. 12514, pp. 65–80).
Springer. https://doi.org/10.1007/978-3-030-64348-5_6
bibtex: '@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture
Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the
Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={10.1007/978-3-030-64348-5_6},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer},
author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der
Heide, Friedhelm}, editor={Devismes , Stéphane and Mittal, Neeraj Editors}, year={2020},
pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }'
chicago: Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem
– Slow Down to Speed Up.” In Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal,
12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. https://doi.org/10.1007/978-3-030-64348-5_6.
ieee: J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete
and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,”
in Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings,
2020, vol. 12514, pp. 65–80.
mla: Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation
Problem – Slow Down to Speed Up.” Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings, edited by Stéphane Devismes and Neeraj Mittal,
vol. 12514, Springer, 2020, pp. 65–80, doi:10.1007/978-3-030-64348-5_6.
short: 'J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes
, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems
- 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21,
2020, Proceedings, Springer, 2020, pp. 65–80.'
date_created: 2020-10-06T07:27:10Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_6
editor:
- first_name: 'Stéphane '
full_name: 'Devismes , Stéphane '
last_name: 'Devismes '
- first_name: 'Neeraj '
full_name: 'Mittal, Neeraj '
last_name: Mittal
external_id:
arxiv:
- '2010.02043 '
intvolume: ' 12514'
language:
- iso: eng
page: 65-80
publication: Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
publication_identifier:
isbn:
- 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down
to Speed Up
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
---
_id: '20185'
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. Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility . In: Devismes S, Mittal N, eds. Stabilization, Safety,
and Security of Distributed Systems - 22nd International Symposium, SSS 2020,
Austin, Texas, USA, November 18-21, 2020, Proceedings . Vol 12514. Lecture
Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:10.1007/978-3-030-64348-5_5'
apa: 'Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide,
F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility . In S. Devismes & N. Mittal
(Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
(Vol. 12514, pp. 60–64). Springer. https://doi.org/10.1007/978-3-030-64348-5_5'
bibtex: '@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020,
series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement:
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots
with Limited Visibility }, volume={12514}, DOI={10.1007/978-3-030-64348-5_5},
booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings },
publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel
and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane and Mittal,
NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer
Science (LNCS)} }'
chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain
of Disoriented & Luminous Robots with Limited Visibility .” In Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer,
2020. https://doi.org/10.1007/978-3-030-64348-5_5.'
ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
“Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &
Luminous Robots with Limited Visibility ,” in Stabilization, Safety, and Security
of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas,
USA, November 18-21, 2020, Proceedings , 2020, vol. 12514, pp. 60–64.'
mla: 'Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A
Closed Chain of Disoriented & Luminous Robots with Limited Visibility .” Stabilization,
Safety, and Security of Distributed Systems - 22nd International Symposium, SSS
2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , edited by Stéphane Devismes
and Neeraj Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:10.1007/978-3-030-64348-5_5.'
short: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in:
S. Devismes, N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed
Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November
18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.'
date_created: 2020-10-23T08:50:28Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '63'
doi: 10.1007/978-3-030-64348-5_5
editor:
- first_name: 'Stéphane '
full_name: 'Devismes, Stéphane '
last_name: Devismes
- first_name: Neeraj
full_name: ' Mittal, Neeraj'
last_name: ' Mittal'
external_id:
arxiv:
- '2010.04424 '
intvolume: ' 12514'
language:
- iso: eng
page: 60-64
publication: 'Stabilization, Safety, and Security of Distributed Systems - 22nd International
Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings '
publication_identifier:
isbn:
- 978-3-030-64347-8
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented
& Luminous Robots with Limited Visibility '
type: conference
user_id: '38705'
volume: 12514
year: '2020'
...
---
_id: '17370'
abstract:
- lang: eng
text: " We consider a natural extension to the metric uncapacitated Facility Location
Problem (FLP) in which requests ask for different commodities out of a finite
set \\( S \\) of commodities.\r\n Ravi and Sinha (SODA 2004) introduced the model
as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered
it an offline optimization problem.\r\n The model itself is similar to the FLP:
i.e., requests are located at points of a finite metric space and the task of
an algorithm is to construct facilities and assign requests to facilities while
minimizing the construction cost and the sum over all assignment distances.\r\n
\ In addition, requests and facilities are heterogeneous; they request or offer
multiple commodities out of $S$.\r\n A request has to be connected to a set of
facilities jointly offering the commodities demanded by it.\r\n In comparison
to the FLP, an algorithm has to decide not only if and where to place facilities,
but also which commodities to offer at each.\r\n\r\n To the best of our knowledge
we are the first to study the problem in its online variant in which requests,
their positions and their commodities are not known beforehand but revealed over
time.\r\n We present results regarding the competitive ratio.\r\n On the one
hand, we show that heterogeneity influences the competitive ratio by developing
a lower bound on the competitive ratio for any randomized online algorithm of
\\( \\Omega ( \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n} ) \\) that already
holds for simple line metrics.\r\n Here, \\( n \\) is the number of requests.\r\n
\ On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n Further,
we show that when considering a more special class of cost functions for the construction
cost of a facility, the competitive ratio decreases given by our deterministic
algorithm depending on the function."
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
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
Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd
ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.
https://doi.org/10.1145/3350755.3400281
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020,
title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann,
Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”
In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020. https://doi.org/10.1145/3350755.3400281.
ieee: J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.
mla: Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.”
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020, doi:10.1145/3350755.3400281.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.'
date_created: 2020-07-14T07:53:20Z
date_updated: 2022-01-06T06:53:10Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3350755.3400281
external_id:
arxiv:
- '2005.08391'
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2020-07-14T07:56:52Z
date_updated: 2020-07-14T07:56:52Z
file_id: '17373'
file_name: 3350755.3400281.pdf
file_size: 1271416
relation: main_file
success: 1
file_date_updated: 2020-07-14T07:56:52Z
has_accepted_license: '1'
keyword:
- Online Multi-Commodity Facility Location
- Competitive Ratio
- Online Optimization
- Facility Location Problem
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: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450369350'
publication_status: published
status: public
title: The Online Multi-Commodity Facility Location Problem
type: conference
user_id: '39241'
year: '2020'
...