---
_id: '20817'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Pawel
full_name: Schmidt, Pawel
last_name: Schmidt
citation:
ama: 'Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online
Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium
on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14'
apa: Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic
Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th
Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17).
https://doi.org/10.4230/LIPIcs.STACS.2021.14
bibtex: '@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal
Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={10.4230/LIPIcs.STACS.2021.14},
booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer
Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt,
Pawel}, year={2021}, pages={14:1-14:17} }'
chicago: Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal
Deterministic Online Algorithm for Non-Metric Facility Location.” In Proceedings
of the 38th Symposium on Theoretical Aspects of Computer Science (STACS),
14:1-14:17, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.14.
ieee: M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic
Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th
Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.
mla: Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm
for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical
Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
short: 'M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium
on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.'
date_created: 2020-12-21T13:46:16Z
date_updated: 2022-01-06T06:54:40Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.STACS.2021.14
language:
- iso: eng
page: 14:1 - 14:17
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 38th Symposium on Theoretical Aspects of Computer
Science (STACS)
publication_status: published
status: public
title: A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location
type: conference
user_id: '22704'
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: '44234'
author:
- first_name: Thilo Frederik
full_name: Berger, Thilo Frederik
last_name: Berger
citation:
ama: Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for
Online Resource Allocation.; 2021.
apa: Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches
for Online Resource Allocation.
bibtex: '@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing
Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021}
}'
chicago: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing
Approaches for Online Resource Allocation, 2021.
ieee: T. F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches
for Online Resource Allocation. 2021.
mla: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches
for Online Resource Allocation. 2021.
short: T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for
Online Resource Allocation, 2021.
date_created: 2023-04-27T15:34:07Z
date_updated: 2023-04-27T15:34:17Z
department:
- _id: '63'
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'
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource
Allocation
type: bachelorsthesis
user_id: '39241'
year: '2021'
...
---
_id: '44233'
author:
- first_name: Sebastian
full_name: Pranger, Sebastian
last_name: Pranger
citation:
ama: Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.;
2021.
apa: Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms.
bibtex: '@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server
Algorithms}, author={Pranger, Sebastian}, year={2021} }'
chicago: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms,
2021.
ieee: S. Pranger, Online k-Facility Reallocation using k-Server Algorithms.
2021.
mla: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms.
2021.
short: S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.
date_created: 2023-04-27T15:31:26Z
date_updated: 2023-04-27T15:31:57Z
department:
- _id: '63'
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'
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online k-Facility Reallocation using k-Server Algorithms
type: bachelorsthesis
user_id: '39241'
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: '20159'
abstract:
- lang: eng
text: "Let G = (V,E) be an undirected graph on n vertices with non-negative capacities
on its edges. The mincut sensitivity problem for the insertion of an edge is defined
as follows. Build a compact data structure for G and a given set S ⊆ V of vertices
that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can
efficiently report the set of all pairs from S× S whose mincut value increases
upon insertion of the edge (x,y) to G. The only result that exists for this problem
is for a single pair of vertices (Picard and Queyranne, Mathematical Programming
Study, 13 (1980), 8-16). We present the following results for the single source
and the all-pairs versions of this problem. \r\n1) Single source: Given any designated
source vertex s, there exists a data structure of size \U0001D4AA(|S|) that can
output all those vertices from S whose mincut value to s increases upon insertion
of any given edge. The time taken by the data structure to answer any query is
\U0001D4AA(|S|). \r\n2) All-pairs: There exists an \U0001D4AA(|S|²) size data
structure that can output all those pairs of vertices from S× S whose mincut value
gets increased upon insertion of any given edge. The time taken by the data structure
to answer any query is \U0001D4AA(k), where k is the number of pairs of vertices
whose mincut increases. \r\nFor both these versions, we also address the problem
of reporting the values of the mincuts upon insertion of any given edge. To derive
our results, we use interesting insights into the nearest and the farthest mincuts
for a pair of vertices. In addition, a crucial result, that we establish and use
in our data structures, is that there exists a directed acyclic graph of \U0001D4AA(n)
size that compactly stores the farthest mincuts from all vertices of V to a designated
vertex s in the graph. We believe that this result is of independent interest,
especially, because it also complements a previously existing result by Hariharan
et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar
family, and hence, can be stored compactly in a tree of \U0001D4AA(n) size."
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. In: Grandoni F, Herman G, Sanders P, eds. 28th Annual
European Symposium on Algorithms (ESA 2020). Vol 173. Leibniz International
Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum
für Informatik; 2020:12:1-12:14. doi:10.4230/LIPIcs.ESA.2020.12'
apa: 'Baswana, S., Gupta, S., & Knollmann, T. (2020). Mincut Sensitivity Data
Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, & P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020) (Vol. 173,
pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ESA.2020.12'
bibtex: '@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany},
series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut
Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={10.4230/LIPIcs.ESA.2020.12},
booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss
Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta,
Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and
Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: 'Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” In 28th Annual European Symposium
on Algorithms (ESA 2020), edited by Fabrizio Grandoni, Grzegorz Herman, and
Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik,
2020. https://doi.org/10.4230/LIPIcs.ESA.2020.12.'
ieee: S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” in 28th Annual European Symposium on Algorithms
(ESA 2020), 2020, vol. 173, pp. 12:1-12:14.
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” 28th Annual European Symposium on Algorithms (ESA 2020), edited
by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für
Informatik, 2020, pp. 12:1-12:14, doi:10.4230/LIPIcs.ESA.2020.12.
short: 'S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders
(Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl
-- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.'
date_created: 2020-10-21T12:00:20Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2020.12
editor:
- first_name: Fabrizio
full_name: Grandoni, Fabrizio
last_name: Grandoni
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
- first_name: Peter
full_name: Sanders, Peter
last_name: Sanders
intvolume: ' 173'
keyword:
- Mincut
- Sensitivity
- Data Structure
language:
- iso: eng
page: 12:1-12:14
place: Dagstuhl, Germany
publication: 28th Annual European Symposium on Algorithms (ESA 2020)
publication_identifier:
isbn:
- 978-3-95977-162-7
issn:
- 1868-8969
publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: conference
user_id: '39241'
volume: 173
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'
...
---
_id: '17371'
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. Brief Announcement:
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down
to Speed up. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures. ; 2020. doi:10.1145/3350755.3400263'
apa: 'Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2020).
Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
Problem: Slow Down to Speed up. In Proceedings of the 32nd ACM Symposium on
Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400263'
bibtex: '@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief
Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem:
Slow Down to Speed up}, DOI={10.1145/3350755.3400263},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till
and Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: 'Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
Problem: Slow Down to Speed Up.” In Proceedings of the 32nd ACM Symposium on
Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400263.'
ieee: 'J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement:
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down
to Speed up,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures, 2020.'
mla: 'Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study
of the Max-Chain-Formation Problem: Slow Down to Speed Up.” Proceedings of
the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020,
doi:10.1145/3350755.3400263.'
short: 'J. Castenow, P. Kling, T. Knollmann, 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:47Z
date_updated: 2022-01-06T06:53:10Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3350755.3400263
external_id:
arxiv:
- '2010.02043 '
file:
- access_level: closed
content_type: application/pdf
creator: janniksu
date_created: 2020-07-14T07:56:04Z
date_updated: 2020-07-14T07:56:04Z
file_id: '17372'
file_name: 3350755.3400263.pdf
file_size: 1078544
relation: main_file
success: 1
file_date_updated: 2020-07-14T07:56:04Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450369350'
publication_status: published
status: public
title: 'Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
Problem: Slow Down to Speed up'
type: conference
user_id: '38705'
year: '2020'
...
---
_id: '16968'
abstract:
- lang: eng
text: "In this work, we initiate the research about the Gathering problem for robots\r\nwith
limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering
problem, a set of initially scattered robots is required to gather at\r\nthe same
position. The robots' capabilities are very restricted -- they do not\r\nagree
on any coordinate system or compass, have a limited viewing range, have\r\nno
memory of the past and cannot communicate. We study the problem in two\r\ndifferent
time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous
time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove
a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for
the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization
of contracting strategies (continuous time) from\r\n[Algosensors'17] to three
dimensions. In contracting strategies, every robot\r\nthat is located on the global
convex hull of all robots' positions moves with\r\nfull speed towards the inside
of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$
for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the
diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$
close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true
in two dimensions. In general, it might be hard for\r\nrobots with limited viewing
range to decide whether they are located on the\r\nglobal convex hull and which
movement maintains the connectivity of the swarm,\r\nrendering the design of concrete
contracting strategies a challenging task. We\r\nprove that the continuous variant
of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover,
we give a simple design criterion for\r\nthree-dimensional contracting strategies
that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy
based on this criterion."
- lang: eng
text: Best Student Paper Award
author:
- first_name: Michael
full_name: Braun, Michael
last_name: Braun
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots
in Three Dimensions. In: Proceedings of the 27th Conference on Structural Information
and Communication Complexity (SIROCCO). Springer; 2020. doi:10.1007/978-3-030-54921-3_4'
apa: 'Braun, M., Castenow, J., & Meyer auf der Heide, F. (2020). Local Gathering
of Mobile Robots in Three Dimensions. In Proceedings of the 27th Conference
on Structural Information and Communication Complexity (SIROCCO). Paderborn:
Springer. https://doi.org/10.1007/978-3-030-54921-3_4'
bibtex: '@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering
of Mobile Robots in Three Dimensions}, DOI={10.1007/978-3-030-54921-3_4},
booktitle={Proceedings of the 27th Conference on Structural Information and Communication
Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow,
Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local
Gathering of Mobile Robots in Three Dimensions.” In Proceedings of the 27th
Conference on Structural Information and Communication Complexity (SIROCCO).
Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3_4.
ieee: M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile
Robots in Three Dimensions,” in Proceedings of the 27th Conference on Structural
Information and Communication Complexity (SIROCCO), Paderborn, 2020.
mla: Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.”
Proceedings of the 27th Conference on Structural Information and Communication
Complexity (SIROCCO), Springer, 2020, doi:10.1007/978-3-030-54921-3_4.
short: 'M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th
Conference on Structural Information and Communication Complexity (SIROCCO), Springer,
2020.'
conference:
end_date: 2020-07-01
location: Paderborn
name: SIROCCO 2020
start_date: 2020-06-29
date_created: 2020-05-18T06:48:35Z
date_updated: 2022-01-06T06:53:00Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-030-54921-3_4
external_id:
arxiv:
- arXiv:2005.07495
file:
- access_level: closed
content_type: application/pdf
creator: janniksu
date_created: 2020-07-31T08:22:16Z
date_updated: 2020-07-31T08:22:16Z
file_id: '17504'
file_name: localGathering.pdf
file_size: 505712
relation: main_file
success: 1
file_date_updated: 2020-07-31T08:22:16Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of the 27th Conference on Structural Information and Communication
Complexity (SIROCCO)
publisher: Springer
status: public
title: Local Gathering of Mobile Robots in Three Dimensions
type: conference
user_id: '38705'
year: '2020'
...
---
_id: '15631'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
citation:
ama: Feldkord B. Mobile Resource Allocation. Universität Paderborn; 2020.
doi:10.17619/UNIPB/1-869
apa: Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-869
bibtex: '@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource
Allocation}, DOI={10.17619/UNIPB/1-869},
author={Feldkord, Björn}, year={2020} }'
chicago: Feldkord, Björn. Mobile Resource Allocation. Universität Paderborn,
2020. https://doi.org/10.17619/UNIPB/1-869.
ieee: B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.
mla: Feldkord, Björn. Mobile Resource Allocation. 2020, doi:10.17619/UNIPB/1-869.
short: B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.
date_created: 2020-01-23T14:20:25Z
date_updated: 2022-01-06T06:52:31Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-869
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2020-01-24T08:19:38Z
date_updated: 2020-01-24T08:19:38Z
file_id: '15634'
file_name: DissertationFeldkord.pdf
file_size: 633652
relation: main_file
success: 1
file_date_updated: 2020-01-24T08:19:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Mobile Resource Allocation
type: dissertation
user_id: '15415'
year: '2020'
...
---
_id: '15025'
abstract:
- lang: eng
text: In software engineering, the imprecise requirements of a user are transformed
to a formal requirements specification during the requirements elicitation process.
This process is usually guided by requirements engineers interviewing the user.
We want to partially automate this first step of the software engineering process
in order to enable users to specify a desired software system on their own. With
our approach, users are only asked to provide exemplary behavioral descriptions.
The problem of synthesizing a requirements specification from examples can partially
be reduced to the problem of grammatical inference, to which we apply an active
coevolutionary learning approach. However, this approach would usually require
many feedback queries to be sent to the user. In this work, we extend and generalize
our active learning approach to receive knowledge from multiple oracles, also
known as proactive learning. The ‘user oracle’ represents input received from
the user and the ‘knowledge oracle’ represents available, formalized domain knowledge.
We call our two-oracle approach the ‘first apply knowledge then query’ (FAKT/Q)
algorithm. We compare FAKT/Q to the active learning approach and provide an extensive
benchmark evaluation. As result we find that the number of required user queries
is reduced and the inference process is sped up significantly. Finally, with so-called
On-The-Fly Markets, we present a motivation and an application of our approach
where such knowledge is available.
author:
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Wever MD, van Rooijen L, Hamann H. Multi-Oracle Coevolutionary Learning of
Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary
Computation. 2020;28(2):165–193. doi:10.1162/evco_a_00266
apa: Wever, M. D., van Rooijen, L., & Hamann, H. (2020). Multi-Oracle Coevolutionary
Learning of Requirements Specifications from Examples in On-The-Fly Markets. Evolutionary
Computation, 28(2), 165–193. https://doi.org/10.1162/evco_a_00266
bibtex: '@article{Wever_van Rooijen_Hamann_2020, title={Multi-Oracle Coevolutionary
Learning of Requirements Specifications from Examples in On-The-Fly Markets},
volume={28}, DOI={10.1162/evco_a_00266},
number={2}, journal={Evolutionary Computation}, publisher={MIT Press Journals},
author={Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}, year={2020},
pages={165–193} }'
chicago: 'Wever, Marcel Dominik, Lorijn van Rooijen, and Heiko Hamann. “Multi-Oracle
Coevolutionary Learning of Requirements Specifications from Examples in On-The-Fly
Markets.” Evolutionary Computation 28, no. 2 (2020): 165–193. https://doi.org/10.1162/evco_a_00266.'
ieee: 'M. D. Wever, L. van Rooijen, and H. Hamann, “Multi-Oracle Coevolutionary
Learning of Requirements Specifications from Examples in On-The-Fly Markets,”
Evolutionary Computation, vol. 28, no. 2, pp. 165–193, 2020, doi: 10.1162/evco_a_00266.'
mla: Wever, Marcel Dominik, et al. “Multi-Oracle Coevolutionary Learning of Requirements
Specifications from Examples in On-The-Fly Markets.” Evolutionary Computation,
vol. 28, no. 2, MIT Press Journals, 2020, pp. 165–193, doi:10.1162/evco_a_00266.
short: M.D. Wever, L. van Rooijen, H. Hamann, Evolutionary Computation 28 (2020)
165–193.
date_created: 2019-11-18T14:19:19Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
- _id: '63'
- _id: '238'
doi: 10.1162/evco_a_00266
intvolume: ' 28'
issue: '2'
language:
- iso: eng
page: 165–193
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Evolutionary Computation
publication_status: published
publisher: MIT Press Journals
related_material:
link:
- relation: confirmation
url: https://www.mitpressjournals.org/doi/pdf/10.1162/evco_a_00266
status: public
title: Multi-Oracle Coevolutionary Learning of Requirements Specifications from Examples
in On-The-Fly Markets
type: journal_article
user_id: '15415'
volume: 28
year: '2020'
...
---
_id: '15169'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
in Hybrid Communication Networks. In: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN). ACM.'
apa: 'Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 21st International Conference on Distributed Computing and Networking (ICDCN).
Kolkata, Indien: ACM.'
bibtex: '@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler,
Christian} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN).
ACM, n.d.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 21st International Conference
on Distributed Computing and Networking (ICDCN), ACM.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.'
conference:
end_date: 07.01.2020
location: Kolkata, Indien
name: '21st International Conference on Distributed Computing and Networking '
start_date: 04.01.2020
date_created: 2019-11-25T12:18:41Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '63'
- _id: '79'
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 21st International Conference on Distributed Computing
and Networking (ICDCN)
publication_status: accepted
publisher: ACM
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2020'
...
---
_id: '16299'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jonas
full_name: Harbig, Jonas
last_name: Harbig
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous,
Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309.
doi:10.1016/j.tcs.2020.02.018
apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide,
F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer
Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018
bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering
Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={10.1016/j.tcs.2020.02.018},
journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer,
Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2020}, pages={289–309} }'
chicago: 'Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm
Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical
Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.'
ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering
Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol.
815, pp. 289–309, 2020.
mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018.
short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical
Computer Science 815 (2020) 289–309.
date_created: 2020-03-13T12:55:53Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.02.018
intvolume: ' 815'
language:
- iso: eng
page: 289-309
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: journal_article
user_id: '38705'
volume: 815
year: '2020'
...
---
_id: '13868'
author:
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion
Time for Order Scheduling with Setup Times. In: Proceedings of the 46th International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).
; 2020.'
apa: Pukrop, S., Mäcker, A., & Meyer auf der Heide, F. (2020). Approximating
Weighted Completion Time for Order Scheduling with Setup Times. In Proceedings
of the 46th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM).
bibtex: '@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating
Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings
of the 46th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and
Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating
Weighted Completion Time for Order Scheduling with Setup Times.” In Proceedings
of the 46th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM), 2020.
ieee: S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted
Completion Time for Order Scheduling with Setup Times,” in Proceedings of the
46th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM), 2020.
mla: Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling
with Setup Times.” Proceedings of the 46th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM), 2020.
short: 'S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th
International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM), 2020.'
date_created: 2019-10-15T12:19:49Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
publication: Proceedings of the 46th International Conference on Current Trends in
Theory and Practice of Computer Science (SOFSEM)
status: public
title: Approximating Weighted Completion Time for Order Scheduling with Setup Times
type: conference
user_id: '44428'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering.
2020;62(6):467-481. doi:10.1007/s12599-019-00627-x'
apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020).
A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information
Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x'
bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x},
number={6}, journal={Business & Information Systems Engineering}, publisher={Springer},
author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
Wehrheim, Heike}, year={2020}, pages={467–481} }'
chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business &
Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x.'
ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems
Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.'
mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
Business & Information Systems Engineering, vol. 62, no. 6, Springer,
2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.'
short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &
Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-12-12T10:24:47Z
date_updated: 2019-12-12T10:24:47Z
file_id: '15311'
file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
file_size: 454532
relation: main_file
success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: ' 62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
- _id: '82'
name: SFB 901 - Project Area T
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '6'
name: SFB 901 - Subproject A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '9'
name: SFB 901 - Subproject B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '15'
name: SFB 901 - Subproject C3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '17'
name: SFB 901 - Subproject C5
- _id: '83'
name: SFB 901 -Subproject T1
- _id: '84'
name: SFB 901 -Subproject T2
- _id: '107'
name: SFB 901 -Subproject T3
- _id: '158'
name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '17432'
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Ayush
full_name: Tulsyan, Ayush
last_name: Tulsyan
citation:
ama: 'Baswana S, Gupta S, Tulsyan A. Fault Tolerant and Fully Dynamic DFS in Undirected
Graphs: Simple Yet Efficient. In: 44th International Symposium on Mathematical
Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings
in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2019:65:1--65:16.
doi:10.4230/LIPICS.MFCS.2019.65'
apa: 'Baswana, S., Gupta, S., & Tulsyan, A. (2019). Fault Tolerant and Fully
Dynamic DFS in Undirected Graphs: Simple Yet Efficient. In 44th International
Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (pp.
65:1--65:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.65'
bibtex: '@inproceedings{Baswana_Gupta_Tulsyan_2019, series={Leibniz International
Proceedings in Informatics (LIPIcs)}, title={Fault Tolerant and Fully Dynamic
DFS in Undirected Graphs: Simple Yet Efficient}, DOI={10.4230/LIPICS.MFCS.2019.65},
booktitle={44th International Symposium on Mathematical Foundations of Computer
Science (MFCS 2019)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
author={Baswana, Surender and Gupta, Shiv and Tulsyan, Ayush}, year={2019}, pages={65:1--65:16},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Baswana, Surender, Shiv Gupta, and Ayush Tulsyan. “Fault Tolerant and
Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient.” In 44th International
Symposium on Mathematical Foundations of Computer Science (MFCS 2019), 65:1--65:16.
Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.65.'
ieee: 'S. Baswana, S. Gupta, and A. Tulsyan, “Fault Tolerant and Fully Dynamic DFS
in Undirected Graphs: Simple Yet Efficient,” in 44th International Symposium
on Mathematical Foundations of Computer Science (MFCS 2019), 2019, pp. 65:1--65:16.'
mla: 'Baswana, Surender, et al. “Fault Tolerant and Fully Dynamic DFS in Undirected
Graphs: Simple Yet Efficient.” 44th International Symposium on Mathematical
Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2019, pp. 65:1--65:16, doi:10.4230/LIPICS.MFCS.2019.65.'
short: 'S. Baswana, S. Gupta, A. Tulsyan, in: 44th International Symposium on Mathematical
Foundations of Computer Science (MFCS 2019), Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2019, pp. 65:1--65:16.'
date_created: 2020-07-29T07:33:56Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
doi: 10.4230/LIPICS.MFCS.2019.65
language:
- iso: eng
page: 65:1--65:16
publication: 44th International Symposium on Mathematical Foundations of Computer
Science (MFCS 2019)
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient'
type: conference
user_id: '15415'
year: '2019'
...