---
_id: '13939'
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Kling P, Meyer auf der Heide F. Continuous Protocols for Swarm Robotics. In:
Distributed Computing by Mobile Entities, Current Research in Moving and Computing.
Vol 11340. Lecture Notes in Computer Science. Springer; 2019:317-334. doi:10.1007/978-3-030-11072-7\_13'
apa: Kling, P., & Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm
Robotics. In Distributed Computing by Mobile Entities, Current Research in
Moving and Computing (Vol. 11340, pp. 317–334). Springer. https://doi.org/10.1007/978-3-030-11072-7\_13
bibtex: '@inbook{Kling_Meyer auf der Heide_2019, series={Lecture Notes in Computer
Science}, title={Continuous Protocols for Swarm Robotics}, volume={11340}, DOI={10.1007/978-3-030-11072-7\_13},
booktitle={Distributed Computing by Mobile Entities, Current Research in Moving
and Computing}, publisher={Springer}, author={Kling, Peter and Meyer auf der Heide,
Friedhelm}, year={2019}, pages={317–334}, collection={Lecture Notes in Computer
Science} }'
chicago: Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols
for Swarm Robotics.” In Distributed Computing by Mobile Entities, Current Research
in Moving and Computing, 11340:317–34. Lecture Notes in Computer Science.
Springer, 2019. https://doi.org/10.1007/978-3-030-11072-7\_13.
ieee: P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,”
in Distributed Computing by Mobile Entities, Current Research in Moving and
Computing, vol. 11340, Springer, 2019, pp. 317–334.
mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for
Swarm Robotics.” Distributed Computing by Mobile Entities, Current Research
in Moving and Computing, vol. 11340, Springer, 2019, pp. 317–34, doi:10.1007/978-3-030-11072-7\_13.
short: 'P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities,
Current Research in Moving and Computing, Springer, 2019, pp. 317–334.'
date_created: 2019-10-21T13:20:43Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.1007/978-3-030-11072-7\_13
intvolume: ' 11340'
language:
- iso: eng
page: 317-334
publication: Distributed Computing by Mobile Entities, Current Research in Moving
and Computing
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Continuous Protocols for Swarm Robotics
type: book_chapter
user_id: '15415'
volume: 11340
year: '2019'
...
---
_id: '13942'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover
and Leasing Non-metric Facility Location. In: Proceedings of the 8th International
Conference on Operations Research and Enterprise Systems. SciTePress; 2019:315-321.
doi:10.5220/0007369503150321'
apa: Markarian, C., & Meyer auf der Heide, F. (2019). Online Algorithms for
Leasing Vertex Cover and Leasing Non-metric Facility Location. In Proceedings
of the 8th International Conference on Operations Research and Enterprise Systems
(pp. 315–321). SciTePress. https://doi.org/10.5220/0007369503150321
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms
for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={10.5220/0007369503150321},
booktitle={Proceedings of the 8th International Conference on Operations Research
and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine
and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In Proceedings
of the 8th International Conference on Operations Research and Enterprise Systems,
315–21. SciTePress, 2019. https://doi.org/10.5220/0007369503150321.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex
Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th
International Conference on Operations Research and Enterprise Systems, 2019,
pp. 315–321.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” Proceedings
of the 8th International Conference on Operations Research and Enterprise Systems,
SciTePress, 2019, pp. 315–21, doi:10.5220/0007369503150321.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International
Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp.
315–321.'
date_created: 2019-10-21T13:42:50Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.5220/0007369503150321
language:
- iso: eng
page: 315-321
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 8th International Conference on Operations Research
and Enterprise Systems
publisher: SciTePress
status: public
title: Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility
Location
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13946'
author:
- first_name: Faisal N.
full_name: Abu-Khzam, Faisal N.
last_name: Abu-Khzam
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
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: Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient
parallel algorithms for parameterized problems. Theoretical Computer Science.
2019;786:2-12. doi:10.1016/j.tcs.2018.11.006
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2019). Efficient parallel algorithms for parameterized problems. Theoretical
Computer Science, 786, 2–12. https://doi.org/10.1016/j.tcs.2018.11.006
bibtex: '@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient
parallel algorithms for parameterized problems}, volume={786}, DOI={10.1016/j.tcs.2018.11.006},
journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
year={2019}, pages={2–12} }'
chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized
Problems.” Theoretical Computer Science 786 (2019): 2–12. https://doi.org/10.1016/j.tcs.2018.11.006.'
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“Efficient parallel algorithms for parameterized problems,” Theoretical Computer
Science, vol. 786, pp. 2–12, 2019.
mla: Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized
Problems.” Theoretical Computer Science, vol. 786, 2019, pp. 2–12, doi:10.1016/j.tcs.2018.11.006.
short: F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
Theoretical Computer Science 786 (2019) 2–12.
date_created: 2019-10-21T13:57:06Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2018.11.006
intvolume: ' 786'
language:
- iso: eng
page: 2-12
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theoretical Computer Science
status: public
title: Efficient parallel algorithms for parameterized problems
type: journal_article
user_id: '15415'
volume: 786
year: '2019'
...
---
_id: '14539'
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 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26'
apa: Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\_26
bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\_26},
booktitle={Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina
and Scheideler, Christian}, year={2019}, pages={345–348} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\_26.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
L’Aquila, Italy, 2019, pp. 345–348.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 26th International Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2019, pp.
345–48, doi:10.1007/978-3-030-24922-9\_26.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019,
pp. 345–348.'
conference:
end_date: 2019-07-04
location: L'Aquila, Italy
name: SIROCCO 2019
start_date: 2019-07-01
date_created: 2019-11-04T10:09:35Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-030-24922-9\_26
language:
- iso: eng
page: 345-348
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10281'
abstract:
- lang: eng
text: 'Competing firms tend to select similar locations for their stores. This phenomenon,
called the principle of minimum differentiation, was captured by Hotelling with
a landmark model of spatial competition but is still the object of an ongoing
scientific debate. Although consistently observed in practice, many more realistic
variants of Hotelling''s model fail to support minimum differentiation or do not
have pure equilibria at all. In particular, it was recently proven for a generalized
model which incorporates negative network externalities and which contains Hotelling''s
model and classical selfish load balancing as special cases, that the unique equilibria
do not adhere to minimum differentiation. Furthermore, it was shown that for a
significant parameter range pure equilibria do not exist. We derive a sharp contrast
to these previous results by investigating Hotelling''s model with negative network
externalities from an entirely new angle: approximate pure subgame perfect equilibria.
This approach allows us to prove analytically and via agent-based simulations
that approximate equilibria having good approximation guarantees and that adhere
to minimum differentiation exist for the full parameter range of the model. Moreover,
we show that the obtained approximate equilibria have high social welfare.'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: 'Pascal '
full_name: 'Lenzner, Pascal '
last_name: Lenzner
- first_name: Louise
full_name: Molitor, Louise
last_name: Molitor
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Lenzner P, Molitor L, Skopalik A. From Hotelling to Load Balancing:
Approximation and the Principle of Minimum Differentiation. In: Proceedings
of the 18th International Conference on Autonomous Agents and MultiAgent Systems.
International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.'
apa: 'Feldotto, M., Lenzner, P., Molitor, L., & Skopalik, A. (2019). From Hotelling
to Load Balancing: Approximation and the Principle of Minimum Differentiation.
In Proceedings of the 18th International Conference on Autonomous Agents and
MultiAgent Systems (pp. 1949--1951). Montreal QC, Canada: International Foundation
for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling
to Load Balancing: Approximation and the Principle of Minimum Differentiation},
booktitle={Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents
and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal and Molitor,
Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }'
chicago: 'Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik.
“ From Hotelling to Load Balancing: Approximation and the Principle of Minimum
Differentiation.” In Proceedings of the 18th International Conference on Autonomous
Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous
Agents and Multiagent Systems, 2019.'
ieee: 'M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to
Load Balancing: Approximation and the Principle of Minimum Differentiation,” in
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent
Systems, Montreal QC, Canada, 2019, pp. 1949--1951.'
mla: 'Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation
and the Principle of Minimum Differentiation.” Proceedings of the 18th International
Conference on Autonomous Agents and MultiAgent Systems, International Foundation
for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
short: 'M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the
18th International Conference on Autonomous Agents and MultiAgent Systems, International
Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.'
conference:
location: Montreal QC, Canada
name: 18th International Conference on Autonomous Agents and MultiAgent Systems
date_created: 2019-06-20T14:46:08Z
date_updated: 2022-01-06T06:50:33Z
ddc:
- '004'
department:
- _id: '541'
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:10:02Z
date_updated: 2019-08-26T11:10:02Z
file_id: '12962'
file_name: 1903.04265.pdf
file_size: 698599
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:10:02Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=3331973
page: 1949--1951
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the 18th International Conference on Autonomous Agents
and MultiAgent Systems
publication_status: published
publisher: International Foundation for Autonomous Agents and Multiagent Systems
status: public
title: ' From Hotelling to Load Balancing: Approximation and the Principle of Minimum
Differentiation'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10344'
author:
- first_name: Simon
full_name: Pukrop, Simon
last_name: Pukrop
citation:
ama: Pukrop S. Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine. Universität Paderborn; 2019.
apa: Pukrop, S. (2019). Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn.
bibtex: '@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs
with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop,
Simon}, year={2019} }'
chicago: Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn, 2019.
ieee: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine. Universität Paderborn, 2019.
mla: Pukrop, Simon. Scheduling Algorithms for Multi-Operation Jobs with Setups
on a Single Machine. Universität Paderborn, 2019.
short: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
a Single Machine, Universität Paderborn, 2019.
date_created: 2019-07-04T07:21:19Z
date_updated: 2022-01-06T06:50:37Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '2484'
abstract:
- lang: eng
text: We study the classic bin packing problem in a fully-dynamic setting, where
new items can arrive and old items may depart. We want algorithms with low asymptotic
competitive ratio while repacking items sparingly between updates. Formally, each
item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
This is motivated by cloud storage applications, where fully-dynamic bin packing
models the problem of data backup to minimize the number of disks used, as well
as communication incurred in moving file backups between disks. Since the set
of files changes over time, we could recompute a solution periodically from scratch,
but this would give a high number of disk rewrites, incurring a high energy cost
and possible wear and tear of the disks. In this work, we present optimal tradeoffs
between number of bins used and number of items repacked, as well as natural extensions
of the latter measure.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Anupam
full_name: Gupta, Anupam
last_name: Gupta
- first_name: Guru
full_name: Guruganesh, Guru
last_name: Guruganesh
- first_name: 'Amit '
full_name: 'Kumar, Amit '
last_name: Kumar
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: David
full_name: Wajc, David
last_name: Wajc
citation:
ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018).
Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51'
apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
(Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51'
bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
(LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
DOI={10.4230/LIPIcs.ICALP.2018.51},
booktitle={45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar,
Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
In 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.'
ieee: B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,”
in 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018),
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
51:1-51:24.'
conference:
end_date: 2018-07-13
location: Prag
name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018)
start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
full_name: Chatzigiannakis, Ioannis
last_name: Chatzigiannakis
- first_name: Christos
full_name: Kaklamanis, Christos
last_name: Kaklamanis
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
- first_name: Donald
full_name: Sannella, Donald
last_name: Sannella
external_id:
arxiv:
- '1711.01231'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:18Z
date_updated: 2018-10-31T16:58:18Z
file_id: '5227'
file_name: LIPIcs-ICALP-2018-51.pdf
file_size: 723824
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '16'
name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)
publication_identifier:
isbn:
- 978-3-95977-076-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2485'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities.
In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389'
apa: 'Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location
with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389'
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
Location with Mobile Facilities}, DOI={10.1145/3210377.3210389},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.
ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), Wien, 2018, pp. 373–381.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
location: Wien
name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:42:33Z
date_updated: 2018-11-02T14:42:33Z
file_id: '5280'
file_name: p373-feldkord.pdf
file_size: 1207546
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
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 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '25121'
abstract:
- lang: eng
text: We consider a group of $n$ autonomous mobile robots of which $m$ are stationary
thus cannot move. Robots are represented by points in the Euclidean plane. They
have no memory, do not communicate or share a common coordinate system and they
move solely based on the positioning of other robots within their limited viewing
range of 1. The goal is to gather the robots inside of the convex hull of all
stationary robots. A variant of this problem, the general gathering problem, has
been studied in various different time models. In this work, we consider a continuous
time model, where robots continuously observe their neighbors, compute the next
target of movement and move with a speed limit of 1 at any time. Regarding the
robots' local strategy, we only study contracting algorithms in which every robot
that is positioned on the border of the convex hull of all robots moves into this
hull. We present a time bound of $\mathcal{O}(nd)$ for any general contracting
algorithms in a configuration with only a single stationary robot. For configurations
with more stationary robots, we prove that robots converge against the convex
hull of all stationary robots and that no upper bound on the runtime exists. For
the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle,
we provide linear time bounds.
author:
- first_name: David Jan
full_name: Liedtke, David Jan
id: '55557'
last_name: Liedtke
citation:
ama: Liedtke DJ. Influence of Stationary Robots on Continuous Robot Formation
Problems.; 2018.
apa: Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot
Formation Problems.
bibtex: '@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous
Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }'
chicago: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot
Formation Problems, 2018.
ieee: D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation
Problems. 2018.
mla: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation
Problems. 2018.
short: D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation
Problems, 2018.
date_created: 2021-09-29T12:30:40Z
date_updated: 2022-01-06T06:56:52Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: local
content_type: application/pdf
creator: liedtke
date_created: 2021-09-29T12:21:24Z
date_updated: 2021-09-29T12:21:24Z
file_id: '25124'
file_name: Bachelor - Thesis.pdf
file_size: 6746519
relation: main_file
file_date_updated: 2021-09-29T12:21:24Z
has_accepted_license: '1'
language:
- iso: eng
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Influence of Stationary Robots on Continuous Robot Formation Problems
type: bachelorsthesis
user_id: '55557'
year: '2018'
...
---
_id: '19978'
abstract:
- lang: eng
text: "We introduce the \\emph{Online Connected Dominating Set Leasing} problem\r\n(OCDSL)
in which we are given an undirected connected graph $G = (V, E)$, a set\r\n$\\mathcal{L}$
of lease types each characterized by a duration and cost, and a\r\nsequence of
subsets of $V$ arriving over time. A node can be leased using lease\r\ntype $l$
for cost $c_l$ and remains active for time $d_l$. The adversary gives\r\nin each
step $t$ a subset of nodes that need to be dominated by a connected\r\nsubgraph
consisting of nodes active at time $t$. The goal is to minimize the\r\ntotal leasing
costs. OCDSL contains the \\emph{Parking Permit\r\nProblem}~\\cite{PPP} as a special
subcase and generalizes the classical offline\r\n\\emph{Connected Dominating Set}
problem~\\cite{Guha1998}. It has an $\\Omega(\\log\r\n^2 n + \\log |\\mathcal{L}|)$
randomized lower bound resulting from lower bounds\r\nfor the \\emph{Parking Permit
Problem} and the \\emph{Online Set Cover}\r\nproblem~\\cite{Alon:2003:OSC:780542.780558,Korman},
where $|\\mathcal{L}|$ is the\r\nnumber of available lease types and $n$ is the
number of nodes in the input\r\ngraph. We give a randomized $\\mathcal{O}(\\log
^2 n + \\log |\\mathcal{L}| \\log\r\nn)$-competitive algorithm for OCDSL. We also
give a deterministic algorithm for\r\na variant of OCDSL in which the dominating
subgraph need not be connected, the\r\n\\emph{Online Dominating Set Leasing} problem.
The latter is based on a simple\r\nprimal-dual approach and has an $\\mathcal{O}(|\\mathcal{L}|
\\cdot\r\n\\Delta)$-competitive ratio, where $\\Delta$ is the maximum degree of
the input\r\ngraph."
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: Markarian C. Online Connected Dominating Set Leasing. arXiv:180502994.
2018.
apa: Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.
bibtex: '@article{Markarian_2018, title={Online Connected Dominating Set Leasing},
journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }'
chicago: Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994,
2018.
ieee: C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994.
2018.
mla: Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994,
2018.
short: C. Markarian, ArXiv:1805.02994 (2018).
date_created: 2020-10-12T12:42:54Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:1805.02994
status: public
title: Online Connected Dominating Set Leasing
type: preprint
user_id: '15415'
year: '2018'
...