---
_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'
...
---
_id: '2831'
abstract:
- lang: eng
text: 'We consider a market where final products or services are compositions of
a number of basic services. Users are asked to evaluate the quality of the composed
product after purchase. The quality of the basic service influences the performance
of the composed services but cannot be observed directly. The question we pose
is whether it is possible to use user evaluations on composed services to assess
the quality of basic services. We discuss how to combine aggregation of evaluations
across users and disaggregation of information on composed services to derive
valuations for the single components. As a solution we propose to use the (weighted)
average as aggregation device in connection with the Shapley value as disaggregation
method, since this combination fulfills natural requirements in our context. In
addition, we address some occurring computational issues: We give an approximate
solution concept using only a limited number of evaluations which guarantees nearly
optimal results with reduced running time. Lastly, we show that a slightly modified
Shapley value and the weighted average are still applicable if the evaluation
profiles are incomplete.'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
- first_name: Nadja
full_name: Stroh-Maraun, Nadja
id: '13264'
last_name: Stroh-Maraun
citation:
ama: 'Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations
Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics
of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659'
apa: Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating
User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6).
Irvine, California, USA. https://doi.org/10.1145/3230654.3230659
bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659},
booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen
and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6}
}'
chicago: Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun.
“Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of
the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018),
5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine,
California, USA, 2018, pp. 5:1-5:6.
mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
short: 'M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings
of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon
2018), 2018, pp. 5:1-5:6.'
conference:
end_date: 2018-06-18
location: Irvine, California, USA
name: The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon
2018)
start_date: 2018-06-18
date_created: 2018-05-22T10:28:51Z
date_updated: 2022-01-06T06:58:01Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
- _id: '205'
- _id: '475'
doi: 10.1145/3230654.3230659
file:
- access_level: closed
content_type: application/pdf
creator: nmaraun
date_created: 2018-08-15T07:30:50Z
date_updated: 2018-08-15T07:30:50Z
file_id: '3910'
file_name: Disaggregating User Evaluations Using the Shapley Value.pdf
file_size: 1450171
relation: main_file
success: 1
file_date_updated: 2018-08-15T07:30:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 5:1-5:6
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 13th Workshop on Economics of Networks, Systems and
Computation (NetEcon 2018)
publication_identifier:
isbn:
- 978-1-4503-5916-0
publication_status: published
status: public
title: Disaggregating User Evaluations Using the Shapley Value
type: conference
user_id: '14052'
year: '2018'
...
---
_id: '2848'
author:
- 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
citation:
ama: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
apa: Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible
Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.
https://doi.org/10.1007/s00453-018-0420-y
bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y},
number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
}'
chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5
(2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.'
ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574,
2018.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:18:16Z
date_updated: 2018-11-02T15:18:16Z
file_id: '5298'
file_name: TowardsFlexibleDemandsInOnline.pdf
file_size: 600583
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- 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: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
DOI={10.1007/s00224-017-9836-z},
journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2018} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
Theory of Computing Systems, 2018.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems,
Springer, 2018, doi:10.1007/s00224-017-9836-z.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:24:32Z
date_updated: 2018-11-02T15:24:32Z
file_id: '5301'
file_name: ApproximationAndHeuristicAlgor.pdf
file_size: 1371624
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:24:32Z
has_accepted_license: '1'
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: Theory of Computing Systems
publication_identifier:
unknown:
- 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- 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: Mostafa
full_name: Wahby, Mostafa
last_name: Wahby
citation:
ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive:
Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018.
doi:10.4230/LIPIcs.FUN.2018.22'
apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018).
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms
(FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22'
bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22},
booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
year={2018} }'
chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse
Based on Online Connected Dominating Sets.” In Ninth International Conference
on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.'
ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
& Survive: Charging Robots in a Modern Warehouse based on Online Connected
Dominating Sets,” in Ninth International Conference on Fun with Algorithms
(FUN), 2018.'
mla: 'Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern
Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference
on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.'
short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:15:19Z
date_updated: 2018-11-13T13:15:19Z
file_id: '5536'
file_name: LIPIcs-FUN-2018-22.pdf
file_size: 554298
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:15:19Z
has_accepted_license: '1'
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: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '24396'
abstract:
- lang: eng
text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem
(OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| =
n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of
k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF
asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected
(there is a path between s and t in H) or its associated penalty is paid. The
goal is to minimize the weight of H and the total penalties paid. The current
best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive
algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing
a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF,
which is optimal up to constant factor since OPC-NWSF has a randomized lower bound
of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies
an improvement for two special cases of OPC-NWSF, the Online Prize-collecting
Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner
Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one
of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently
best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log
^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized
\(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et
al. (FOCS 2013), respectively.'
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA).
; 2018. doi:10.1007/978-3-319-94667-2_18'
apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA).
https://doi.org/10.1007/978-3-319-94667-2_18
bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18},
booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian,
Christine}, year={2018} }'
chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting
Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms
(IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.
ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.'
mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA),
2018, doi:10.1007/978-3-319-94667-2_18.
short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA),
Cham, 2018.'
date_created: 2021-09-14T12:23:29Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-94667-2_18
language:
- iso: eng
place: Cham
publication: International Workshop on Combinatorial Algorithms (IWOCA)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '3551'
author:
- first_name: Jürgen
full_name: König, Jürgen
id: '22358'
last_name: König
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob
communication on parallel processors. Journal of Combinatorial Optimization.
2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018).
Scheduling with interjob communication on parallel processors. Journal of Combinatorial
Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3
bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3},
number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen
and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
year={2018}, pages={1356–1379} }'
chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal
of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.'
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with interjob communication on parallel processors,” Journal of Combinatorial
Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79,
doi:10.1007/s10878-018-0325-3.
short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial
Optimization 36 (2018) 1356–1379.
date_created: 2018-07-13T09:57:48Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-018-0325-3
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:20:24Z
date_updated: 2018-11-02T15:20:24Z
file_id: '5299'
file_name: SchedulingWithInterjobCommunic.pdf
file_size: 745708
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:20:24Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1356-1379
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
status: public
title: Scheduling with interjob communication on parallel processors
type: journal_article
user_id: '477'
volume: 36
year: '2018'
...
---
_id: '3851'
author:
- first_name: Samuel
full_name: Koop, Samuel
last_name: Koop
citation:
ama: Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn;
2018.
apa: Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität
Paderborn.
bibtex: '@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität
Paderborn}, author={Koop, Samuel}, year={2018} }'
chicago: Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität
Paderborn, 2018.
ieee: S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn,
2018.
mla: Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität
Paderborn, 2018.
short: S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn,
2018.
date_created: 2018-08-08T11:56:37Z
date_updated: 2022-01-06T06:59:45Z
department:
- _id: '541'
- _id: '63'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Congestion Games mit gewichteten Strategien
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '17651'
abstract:
- lang: eng
text: 'Consider mitigating the effects of denial of service or of malicious traffic
in networks by deleting edges. Edge deletion reduces the DoS or the number of
the malicious flows, but it also inadvertently removes some of the desired flows.
To model this important problem, we formulate two problems: (1) remove all the
undesirable flows while minimizing the damage to the desirable ones and (2) balance
removing the undesirable flows and not removing too many of the desirable flows.
We prove these problems are equivalent to important theoretical problems, thereby
being important not only practically but also theoretically, and very hard to
approximate in a general network. We employ reductions to nonetheless approximate
the problem and also provide a greedy approximation. When the network is a tree,
the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation
algorithm, where l is the longest desirable flow. We also provide an algorithm,
approximating the first and the second problem within {\$}{\$}2 {\backslash}sqrt{\{}
2{\backslash}left| E {\backslash}right| {\}}{\$}{\$}and {\$}{\$}2 {\backslash}sqrt{\{}2
({\backslash}left| E {\backslash}right| + {\backslash}left| {\backslash}text {\{}undesirable
flows{\}} {\backslash}right| ){\}}{\$}{\$}, respectively, where E is the set of
the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm.
Finally, if the tree has a root such that every flow in the tree flows on the
path from the root to a leaf, we solve the problem exactly using dynamic programming.'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows
by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization
and Applications. Cham: Springer International Publishing; 2018:217-232.'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing
Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky
(Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham:
Springer International Publishing.'
bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing
Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and
Applications}, publisher={Springer International Publishing}, author={Polevoy,
Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim,
Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232}
}'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing
Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications,
edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer
International Publishing, 2018.'
ieee: G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable
Flows by Edge Deletion,” in Combinatorial Optimization and Applications,
2018, pp. 217–232.
mla: Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial
Optimization and Applications, edited by Donghyun Kim et al., Springer International
Publishing, 2018, pp. 217–32.
short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma,
A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International
Publishing, Cham, 2018, pp. 217–232.'
date_created: 2020-08-06T15:19:36Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Donghyun
full_name: Kim, Donghyun
last_name: Kim
- first_name: R. N.
full_name: Uma, R. N.
last_name: Uma
- first_name: Alexander
full_name: Zelikovsky, Alexander
last_name: Zelikovsky
extern: '1'
keyword:
- flow
- Red-Blue Set Cover
- Positive-Negative Partial Set Cover
- approximation
- tree
- MAX SNP-hard
- root
- leaf
- dynamic programming
- FPT
language:
- iso: eng
page: 217-232
place: Cham
publication: Combinatorial Optimization and Applications
publication_identifier:
isbn:
- 978-3-030-04651-4
publisher: Springer International Publishing
status: public
title: Removing Undesirable Flows by Edge Deletion
type: conference
user_id: '83983'
year: '2018'
...
---
_id: '17666'
abstract:
- lang: eng
text: 'Software Defined Networks (SDN) and Network Function Virtualisation (NFV)
provide the basis for autonomous response and mitigation against attacks on networked
computer infrastructures. We propose a new framework that uses SDNs and NFV to
achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an
agent running a control loop constantly assesses the security state of the network
by means of observables. The agent reacts to and resolves security problems, while
learning from its previous decisions. Two main metrics govern the decision process
in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate
countermeasures and are the building blocks for self-learning SARNETs that exhibit
autonomous response. In this paper we present the software implementation of the
SARNET framework, evaluate it in a real-life network and discuss the tradeoffs
between parameters used by the SARNET agent and the efficiency of its actions.'
author:
- first_name: R.
full_name: Koning, R.
last_name: Koning
- first_name: B.
full_name: de Graaff, B.
last_name: de Graaff
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: R.
full_name: Meijer, R.
last_name: Meijer
- first_name: C.
full_name: de Laat, C.
last_name: de Laat
- first_name: P.
full_name: Grosso, P.
last_name: Grosso
citation:
ama: Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring
the efficiency of SDN mitigations against attacks on computer infrastructures.
Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011
apa: Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso,
P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer
infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011
bibtex: '@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring
the efficiency of SDN mitigations against attacks on computer infrastructures},
DOI={https://doi.org/10.1016/j.future.2018.08.011},
journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff,
B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018}
}'
chicago: Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso.
“Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.”
Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011.
ieee: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso,
“Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,”
Future Generation Computer Systems, 2018.
mla: Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks
on Computer Infrastructures.” Future Generation Computer Systems, 2018,
doi:https://doi.org/10.1016/j.future.2018.08.011.
short: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future
Generation Computer Systems (2018).
date_created: 2020-08-06T15:23:11Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: https://doi.org/10.1016/j.future.2018.08.011
extern: '1'
keyword:
- Software defined networks
- Network function virtualization
- Cyber attacks
- Cyber security
- Defense efficiency
- Overlay networks
language:
- iso: eng
publication: Future Generation Computer Systems
publication_identifier:
issn:
- 0167-739X
status: public
title: Measuring the efficiency of SDN mitigations against attacks on computer infrastructures
type: journal_article
user_id: '83983'
year: '2018'
...
---
_id: '63'
author:
- first_name: Ernst
full_name: Althaus, Ernst
last_name: Althaus
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- 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
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Jiri
full_name: Sgall, Jiri
last_name: Sgall
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0
apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous
Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0
bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0},
number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
pages={77–92} }'
chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018):
77–92. https://doi.org/10.1007/s10951-017-0518-0.'
ieee: 'E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,”
Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.'
mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.
short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:16:59Z
date_updated: 2018-03-21T13:16:59Z
file_id: '1577'
file_name: 63-main_05.pdf
file_size: 466808
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
text: "While a lot of research in distributed computing has covered solutions for
self-stabilizing computing and topologies, there is far less work on self-stabilization
for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
networks, it should not be taken for granted that a distributed data structure
remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
structure has a wide area of applications including string matching problems while
offering low overhead and efficient operations when embedded on top of a distributed
hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
|x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
is the number of bits needed for storing all keys."
author:
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes
of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1'
apa: 'Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1'
bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
year={2018}, collection={Lecture Notes of Computer Science} }'
chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi
and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_1.
ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
in Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.
mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr
Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
of the 20th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
end_date: 2018-11-07
location: Tokyo
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS)
start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
full_name: Izumi, Taisuke
last_name: Izumi
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
external_id:
arxiv:
- '1809.04923'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:38:37Z
date_updated: 2018-11-02T14:38:37Z
file_id: '5277'
file_name: ASelf-stabilizingHashedPatrici.pdf
file_size: 500005
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: ' 11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
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 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
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 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
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 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '7570'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
citation:
ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems
of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662'
apa: 'Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement:
Communication in Systems of Home Based Mobile Agents. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18.
Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662'
bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement:
Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide,
Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief
Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.'
ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication
in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, 2018.'
mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement:
Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th
on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM
Press, 2018, doi:10.1145/3210377.3210662.'
short: 'F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018.'
conference:
end_date: 2018-07-18
location: Vienna
name: 30th Symposium on Parallelism in Algorithms and Architectures
start_date: 2018-07-16
date_created: 2019-02-06T14:16:19Z
date_updated: 2022-01-06T07:03:40Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210662
file:
- access_level: closed
content_type: application/pdf
creator: jschaef
date_created: 2019-02-06T14:18:35Z
date_updated: 2019-02-06T14:18:35Z
file_id: '7576'
file_name: p359-meyer-auf-der-heide.pdf
file_size: 1504739
relation: main_file
file_date_updated: 2019-02-06T14:18:35Z
has_accepted_license: '1'
language:
- iso: eng
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 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents'
type: conference
user_id: '30291'
year: '2018'
...
---
_id: '4375'
abstract:
- lang: eng
text: "We present a peer-to-peer network that supports the efficient processing
of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional
point space.\\\\\r\nThe network is the same for each dimension, namely a distance
halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe
show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log
m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$
is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore,
if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log
m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms
are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer
based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.
In: Proceedings of the 4th International Symposium on Algorithmic Aspects of
Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4'
apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier,
J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension. In Proceedings of the 4th International Symposium on
Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4
bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018,
title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4},
booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and
Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
year={2018} }'
chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander
Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting
Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th
International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD),
2018. https://doi.org/10.1007/978-3-030-19759-9_4.
ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier,
“A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension,” in Proceedings of the 4th International Symposium on Algorithmic
Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.
mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal
Range Queries of Arbitrary Dimension.” Proceedings of the 4th International
Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier,
in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud
Computing (ALGOCLOUD), 2018.'
conference:
end_date: 2018-08-21
location: Helsinki
name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)
start_date: 2018-08-20
date_created: 2018-09-11T05:26:59Z
date_updated: 2022-01-06T07:01:00Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-19759-9_4
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2018-11-27T10:03:33Z
date_updated: 2018-11-27T10:03:33Z
file_id: '5863'
file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
of arbitrary Dimension.pdf
file_size: 1122875
relation: main_file
success: 1
file_date_updated: 2018-11-27T10:03:33Z
has_accepted_license: '1'
keyword:
- Distributed Storage
- Multi-Dimensional Range Queries
- Peer-to-Peer
- Hilbert Curve
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 4th International Symposium on Algorithmic Aspects
of Cloud Computing (ALGOCLOUD)
status: public
title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
Dimension
type: conference
user_id: '14955'
year: '2018'
...
---
_id: '5403'
author:
- first_name: Marcel
full_name: Geromel, Marcel
last_name: Geromel
citation:
ama: Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.
apa: Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.
bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität
Paderborn}, author={Geromel, Marcel}, year={2018} }'
chicago: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn,
2018.
ieee: M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.
mla: Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.
short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.
date_created: 2018-11-07T09:20:59Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
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: Mobile Facility Leasing
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5404'
author:
- first_name: Patrick Irenäus
full_name: Kolpaczki, Patrick Irenäus
last_name: Kolpaczki
citation:
ama: Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität
Paderborn; 2018.
apa: Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem.
Universität Paderborn.
bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration
Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus},
year={2018} }'
chicago: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration
Problem. Universität Paderborn, 2018.
ieee: P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem.
Universität Paderborn, 2018.
mla: Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration
Problem. Universität Paderborn, 2018.
short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität
Paderborn, 2018.
date_created: 2018-11-07T09:23:17Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
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: Online Algorithmen für das k-Page Migration Problem
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '669'
abstract:
- lang: eng
text: We study a new class of games which generalizes congestion games andits bottleneck
variant. We introduce congestion games with mixed objectives to modelnetwork scenarios
in which players seek to optimize for latency and bandwidths alike.We characterize
the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement
dynamics, the quality of equilibria and show the complexity of thedecision problem.
For games that do not possess PNE we give bounds on the approx-imation ratio of
approximate pure Nash equilibria.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal
of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y
apa: Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed
objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167.
https://doi.org/10.1007/s10878-017-0189-y
bibtex: '@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed
objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer
Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander},
year={2018}, pages={1145–1167} }'
chicago: 'Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Mixed Objectives.” Journal of Combinatorial Optimization 36,
no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.'
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,”
Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.
mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal
of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp.
1145–67, doi:10.1007/s10878-017-0189-y.
short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization
36 (2018) 1145–1167.
date_created: 2017-10-26T14:11:04Z
date_updated: 2022-01-06T07:03:15Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-017-0189-y
external_id:
arxiv:
- '1607.05143'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:57:32Z
date_updated: 2018-10-31T16:57:32Z
file_id: '5226'
file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf
file_size: 605207
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:57:32Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1145-1167
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Combinatorial Optimization
publication_identifier:
issn:
- 1382-6905
- 1573-2886
publication_status: published
publisher: Springer Nature
status: public
title: Congestion games with mixed objectives
type: journal_article
user_id: '14052'
volume: 36
year: '2018'
...
---
_id: '1186'
author:
- first_name: Arne
full_name: Kemper, Arne
last_name: Kemper
citation:
ama: Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential
Functions. Universität Paderborn; 2018.
apa: Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential
Functions. Universität Paderborn.
bibtex: '@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games
via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne},
year={2018} }'
chicago: Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential
Functions. Universität Paderborn, 2018.
ieee: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential
Functions. Universität Paderborn, 2018.
mla: Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential
Functions. Universität Paderborn, 2018.
short: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential
Functions, Universität Paderborn, 2018.
date_created: 2018-03-02T13:47:57Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Pure Nash Equilibria in Robust Congestion Games via Potential Functions
type: mastersthesis
user_id: '14052'
year: '2018'
...
---
_id: '1187'
author:
- first_name: Marcel
full_name: Nachtigall, Marcel
last_name: Nachtigall
citation:
ama: Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition
Game Model. Universität Paderborn; 2018.
apa: Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition
Game Model. Universität Paderborn.
bibtex: '@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player
Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall,
Marcel}, year={2018} }'
chicago: Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player
Composition Game Model. Universität Paderborn, 2018.
ieee: M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition
Game Model. Universität Paderborn, 2018.
mla: Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition
Game Model. Universität Paderborn, 2018.
short: M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition
Game Model, Universität Paderborn, 2018.
date_created: 2018-03-02T13:49:39Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Scenario-driven Strategy Analysis in a n-player Composition Game Model
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1188'
author:
- first_name: Jérôme
full_name: Kempf, Jérôme
last_name: Kempf
citation:
ama: Kempf J. Learning Deterministic Bandit Behaviour Form Compositions.
Universität Paderborn; 2018.
apa: Kempf, J. (2018). Learning deterministic bandit behaviour form compositions.
Universität Paderborn.
bibtex: '@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions},
publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }'
chicago: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions.
Universität Paderborn, 2018.
ieee: J. Kempf, Learning deterministic bandit behaviour form compositions.
Universität Paderborn, 2018.
mla: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions.
Universität Paderborn, 2018.
short: J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität
Paderborn, 2018.
date_created: 2018-03-02T13:51:14Z
date_updated: 2022-01-06T06:51:11Z
department:
- _id: '63'
- _id: '541'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Learning deterministic bandit behaviour form compositions
type: bachelorsthesis
user_id: '14052'
year: '2018'
...
---
_id: '1209'
abstract:
- lang: eng
text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
robots on a grid, in which all robots of the swarm are supposed to gather at a
previously undefined point. Special attention is paid to the strong limitation
of robot capabilities. These include in particular the lack of global control,
a global compass, global visibility and (global) communication skills. Furthermore,
all robots are identical. The robots are given only local abilities. This includes
a constant range of vision. The robots all work completely synchronously. In this
work we present and analyze three different Gathering strategies in different
robot models. We formally prove correctness and total running time: Chapter 4
focuses on minimizing the available robot capabilities. The underlying strategy
completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
aim is to optimize the total running time under using only local robot capabilities:
We additionally allow a constant-sized memory and a constant number of locally
visible statuses (lights, flags). For the strategies of both chapters we show
an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
additionally restrict connectivity and vision to an initially given chain connectivity
in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
citation:
ama: Jung D. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn; 2018. doi:10.17619/UNIPB/1-271
apa: Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-271
bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
DOI={10.17619/UNIPB/1-271},
publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
chicago: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-271.
ieee: D. Jung, Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018.
mla: Jung, Daniel. Local Strategies for Swarm Formations on a Grid. Universität
Paderborn, 2018, doi:10.17619/UNIPB/1-271.
short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2022-01-06T06:51:17Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-271
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_identifier:
isbn:
- 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '15415'
year: '2018'
...
---
_id: '16392'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- 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: 'Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data
Structure for Top-k and k-Select Queries. In: Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications. Cham; 2018. doi:10.1007/978-3-319-98355-4_18'
apa: Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2018). A Dynamic
Distributed Data Structure for Top-k and k-Select Queries. In Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications. Cham. https://doi.org/10.1007/978-3-319-98355-4_18
bibtex: '@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A
Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-98355-4_18},
booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der
Heide, Friedhelm}, year={2018} }'
chicago: Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A
Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In Progress
in Pattern Recognition, Image Analysis, Computer Vision, and Applications.
Cham, 2018. https://doi.org/10.1007/978-3-319-98355-4_18.
ieee: B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed
Data Structure for Top-k and k-Select Queries,” in Progress in Pattern Recognition,
Image Analysis, Computer Vision, and Applications, Cham, 2018.
mla: Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and
k-Select Queries.” Progress in Pattern Recognition, Image Analysis, Computer
Vision, and Applications, 2018, doi:10.1007/978-3-319-98355-4_18.
short: 'B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern
Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.'
date_created: 2020-04-03T07:04:59Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-98355-4_18
language:
- iso: eng
place: Cham
publication: Progress in Pattern Recognition, Image Analysis, Computer Vision, and
Applications
publication_identifier:
isbn:
- '9783319125671'
- '9783319125688'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A Dynamic Distributed Data Structure for Top-k and k-Select Queries
type: book_chapter
user_id: '15415'
year: '2018'
...
---
_id: '1369'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted
budget games. Journal of Combinatorial Optimization. 2018. doi:10.1007/s10878-018-0269-7
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash
equilibria in restricted budget games. Journal of Combinatorial Optimization.
https://doi.org/10.1007/s10878-018-0269-7
bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria
in restricted budget games}, DOI={10.1007/s10878-018-0269-7},
journal={Journal of Combinatorial Optimization}, publisher={Springer Nature},
author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik,
Alexander}, year={2018} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial
Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria
in restricted budget games,” Journal of Combinatorial Optimization, 2018.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.
short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial
Optimization (2018).
date_created: 2018-03-18T11:12:49Z
date_updated: 2022-01-06T06:51:42Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/s10878-018-0269-7
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:56:13Z
date_updated: 2018-10-31T16:56:13Z
file_id: '5225'
file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf
file_size: 561187
relation: main_file
file_date_updated: 2018-10-31T16:56:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Journal of Combinatorial Optimization
publication_identifier:
issn:
- 1382-6905
- 1573-2886
publication_status: epub_ahead
publisher: Springer Nature
status: public
title: Pure Nash equilibria in restricted budget games
type: journal_article
user_id: '14052'
year: '2018'
...
---
_id: '19604'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
citation:
ama: Li S. Parallel Fixed Parameter Tractable Problems. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-252
apa: Li, S. (2017). Parallel fixed parameter tractable problems. Universität
Paderborn. https://doi.org/10.17619/UNIPB/1-252
bibtex: '@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter
tractable problems}, DOI={10.17619/UNIPB/1-252},
author={Li, Shouwei}, year={2017} }'
chicago: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. Universität
Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-252.
ieee: S. Li, Parallel fixed parameter tractable problems. Universität Paderborn,
2017.
mla: Li, Shouwei. Parallel Fixed Parameter Tractable Problems. 2017, doi:10.17619/UNIPB/1-252.
short: S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn,
2017.
date_created: 2020-09-21T13:52:09Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-252
language:
- iso: eng
place: Universität Paderborn
related_material:
link:
- relation: confirmation
url: '10.17619/UNIPB/1-252 '
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Parallel fixed parameter tractable problems
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '2851'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: 'Markarian C. Leasing with Uncertainty. In: International Conference on
Operations Research (OR). ; 2017. doi:10.1007/978-3-319-89920-6_57'
apa: Markarian, C. (2017). Leasing with Uncertainty. In International Conference
on Operations Research (OR). Berlin. https://doi.org/10.1007/978-3-319-89920-6_57
bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={10.1007/978-3-319-89920-6_57},
booktitle={International Conference on Operations Research (OR)}, author={Markarian,
Christine}, year={2017} }'
chicago: Markarian, Christine. “Leasing with Uncertainty.” In International Conference
on Operations Research (OR), 2017. https://doi.org/10.1007/978-3-319-89920-6_57.
ieee: C. Markarian, “Leasing with Uncertainty,” in International Conference on
Operations Research (OR), Berlin, 2017.
mla: Markarian, Christine. “Leasing with Uncertainty.” International Conference
on Operations Research (OR), 2017, doi:10.1007/978-3-319-89920-6_57.
short: 'C. Markarian, in: International Conference on Operations Research (OR),
2017.'
conference:
end_date: Sept 8, 2017
location: Berlin
start_date: Sept 6, 2017
date_created: 2018-05-24T08:44:43Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89920-6_57
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-13T13:16:30Z
date_updated: 2018-11-13T13:16:30Z
file_id: '5537'
file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf
file_size: 257103
relation: main_file
success: 1
file_date_updated: 2018-11-13T13:16:30Z
has_accepted_license: '1'
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: International Conference on Operations Research (OR)
status: public
title: Leasing with Uncertainty
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '24398'
abstract:
- lang: eng
text: 'Through this study, we introduce the idea of applying scheduling techniques
to allocate spatial resources that are shared among multiple robots moving in
a static environment and having temporal constraints on the arrival time to destinations.
To illustrate this idea, we present an exemplified algorithm that plans and assigns
a motion path to each robot. The considered problem is particularly challenging
because: (i) the robots share the same environment and thus the planner must take
into account overlapping paths which cannot happen at the same time; (ii) there
are time deadlines thus the planner must deal with temporal constraints; (iii)
new requests arrive without a priori knowledge thus the planner must be able to
add new paths online and adjust old plans; (iv) the robot motion is subject to
noise thus the planner must be reactive to adapt to online changes. We showcase
the functioning of the proposed algorithm through a set of agent-based simulations.'
author:
- first_name: Yara
full_name: Khaluf, Yara
last_name: Khaluf
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- first_name: Pieter
full_name: Simoens, Pieter
last_name: Simoens
- first_name: Andreagiovanni
full_name: Reina, Andreagiovanni
last_name: Reina
citation:
ama: 'Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space
in Multi-robot Systems. In: International Conference on Practical Applications
of Agents and Multi-Agent Systems (PAAMS 2017). ; 2017. doi:10.1007/978-3-319-59930-4_12'
apa: Khaluf, Y., Markarian, C., Simoens, P., & Reina, A. (2017). Scheduling
Access to Shared Space in Multi-robot Systems. International Conference on
Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017). https://doi.org/10.1007/978-3-319-59930-4_12
bibtex: '@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling
Access to Shared Space in Multi-robot Systems}, DOI={10.1007/978-3-319-59930-4_12},
booktitle={International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens,
Pieter and Reina, Andreagiovanni}, year={2017} }'
chicago: Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina.
“Scheduling Access to Shared Space in Multi-Robot Systems.” In International
Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS
2017). Cham, 2017. https://doi.org/10.1007/978-3-319-59930-4_12.
ieee: 'Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to
Shared Space in Multi-robot Systems,” 2017, doi: 10.1007/978-3-319-59930-4_12.'
mla: Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.”
International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017), 2017, doi:10.1007/978-3-319-59930-4_12.
short: 'Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference
on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham,
2017.'
date_created: 2021-09-14T12:41:58Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '63'
doi: 10.1007/978-3-319-59930-4_12
language:
- iso: eng
place: Cham
publication: International Conference on Practical Applications of Agents and Multi-Agent
Systems (PAAMS 2017)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Scheduling Access to Shared Space in Multi-robot Systems
type: conference
user_id: '15415'
year: '2017'
...
---
_id: '112'
abstract:
- lang: eng
text: We study a model of selfish resource allocation that seeks to incorporate
dependencies among resources as they exist in in modern networked environments.
Our model is inspired by utility functions with constant elasticity of substitution
(CES) which is a well-studied model in economics. We consider congestion games
with different aggregation functions. In particular, we study $L_p$ norms and
analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally,
we give an almost tight characterization based on monotonicity properties to describe
the set of aggregation functions that guarantee the existence of pure Nash equilibria.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Lennart
full_name: Leder, Lennart
last_name: Leder
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities.
In: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19'
apa: Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities.
In Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19
bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion
Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19},
booktitle={Proceedings of the 10th International Conference on Algorithms and
Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik,
Alexander}, year={2017}, pages={222--233}, collection={LNCS} }'
chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Complementarities.” In Proceedings of the 10th International Conference
on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,”
in Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC), 2017, pp. 222--233.
mla: Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings
of the 10th International Conference on Algorithms and Complexity (CIAC),
2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International
Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:58Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-57586-5_19
external_id:
arxiv:
- '1701.07304'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:05:37Z
date_updated: 2018-03-21T13:05:37Z
file_id: '1566'
file_name: 112-FeldottoLederSkopalik2017.pdf
file_size: 264089
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:05:37Z
has_accepted_license: '1'
page: 222--233
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Algorithms and Complexity
(CIAC)
series_title: LNCS
status: public
title: Congestion Games with Complementarities
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '113'
abstract:
- lang: eng
text: We study the computation of approximate pure Nash equilibria in Shapley value
(SV) weighted congestion games, introduced in [19]. This class of games considers
weighted congestion games in which Shapley values are used as an alternative (to
proportional shares) for distributing the total cost of each resource among its
users. We focus on the interesting subclass of such games with polynomial resource
cost functions and present an algorithm that computes approximate pure Nash equilibria
with a polynomial number of strategy updates. Since computing a single strategy
update is hard, we apply sampling techniques which allow us to achieve polynomial
running time. The algorithm builds on the algorithmic ideas of [7], however, to
the best of our knowledge, this is the first algorithmic result on computation
of approximate equilibria using other than proportional shares as player costs
in this setting. We present a novel relation that approximates the Shapley value
of a player by her proportional share and vice versa. As side results, we upper
bound the approximate price of anarchy of such games and significantly improve
the best known factor for computing approximate pure Nash equilibria in weighted
congestion games of [7].
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Martin
full_name: Gairing, Martin
last_name: Gairing
- first_name: Grammateia
full_name: Kotsialou, Grammateia
last_name: Kotsialou
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure
Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings
of the 13th International Conference on Web and Internet Economics (WINE).
; 2017. doi:10.1007/978-3-319-71924-5_14'
apa: Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In
Proceedings of the 13th International Conference on Web and Internet Economics
(WINE). https://doi.org/10.1007/978-3-319-71924-5_14
bibtex: '@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing
Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games},
DOI={10.1007/978-3-319-71924-5_14},
booktitle={Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou,
Grammateia and Skopalik, Alexander}, year={2017} }'
chicago: Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander
Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted
Congestion Games.” In Proceedings of the 13th International Conference on Web
and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
ieee: M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate
Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings
of the 13th International Conference on Web and Internet Economics (WINE),
2017.
mla: Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley
Value Weighted Congestion Games.” Proceedings of the 13th International Conference
on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
short: 'M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the
13th International Conference on Web and Internet Economics (WINE), 2017.'
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:59Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71924-5_14
external_id:
arxiv:
- '1710.01634'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:01:32Z
date_updated: 2018-10-31T17:01:32Z
file_id: '5231'
file_name: Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf
file_size: 279055
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:01:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Conference on Web and Internet
Economics (WINE)
status: public
title: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion
Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '17652'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows
in Networks. In: Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I. Lecture Notes in Computer Science. Cham: Springer International Publishing;
2017:3-17. doi:10.1007/978-3-319-71150-8_1'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering
Undesirable Flows in Networks. In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1'
bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture
Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1},
booktitle={Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer
International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso,
Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering
Undesirable Flows in Networks.” In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.'
ieee: 'G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable
Flows in Networks,” in Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I, 2017, pp. 3–17.'
mla: 'Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial
Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai,
China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.'
short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization
and Applications: 11th International Conference, COCOA 2017, Shanghai, China,
December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
Cham, 2017, pp. 3–17.'
date_created: 2020-08-06T15:19:48Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71150-8_1
extern: '1'
keyword:
- flow
- filter
- MMSA
- set cover
- approximation
- local ratio algorithm
language:
- iso: eng
page: 3-17
place: Cham
publication: 'Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I'
publication_identifier:
isbn:
- 978-3-319-71150-8
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Filtering Undesirable Flows in Networks
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17653'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of
the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In
Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation
Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial
Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.},
year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer,
2017.
ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings
of the 29th Benelux Conference on Artificial Intelligence, 2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings
of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:09Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- interaction
- reciprocation
- contribute
- shared effort
- curbing
- convergence
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Reciprocation Effort Games
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17654'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer;
2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative
Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition
between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference
on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de
Weerdt, M.M.}, year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.”
In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
CCIS. Springer, 2017.
ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,”
in Proceedings of the 29th Benelux Conference on Artificial Intelligence,
2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.”
Proceedings of the 29th Benelux Conference on Artificial Intelligence,
Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:19Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agents
- projects
- contribute
- shared effort game
- competition
- quota
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Competition between Cooperative Projects
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17811'
abstract:
- lang: eng
text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional
grid. A basic task for such a swarm is the gathering process: All\r\nrobots have
to gather at one (not predefined) place. A common local model for\r\nextremely
simple robots is the following: The robots do not have a common\r\ncompass, only
have a constant viewing radius, are autonomous and\r\nindistinguishable, can move
at most a constant distance in each step, cannot\r\ncommunicate, are oblivious
and do not have flags or states. The only gathering\r\nalgorithm under this robot
model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works
in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the
fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case
of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same
time and a similar local model additionally require a\r\nconstant memory, states
and \"flags\" to communicate these states to neighbors in\r\nviewing range. They
gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the
best of our knowledge) first\r\ngathering algorithm on the grid that works under
the same simple local model as\r\nthe above mentioned Euclidean plane strategy,
i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness
and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$
time model. This time bound\r\nmatches the time bound of the best known algorithm
for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots
are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such
configurations cannot be\r\nsolved."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- 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: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots
on a Grid. arXiv:170203400. 2017.
apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous,
Oblivious Robots on a Grid. ArXiv:1702.03400.
bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous,
Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias
and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }'
chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering
Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017.
ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
Robots on a Grid,” arXiv:1702.03400. 2017.
mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
ArXiv:1702.03400, 2017.
short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).
date_created: 2020-08-11T13:48:38Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:1702.03400
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: preprint
user_id: '15415'
year: '2017'
...
---
_id: '79'
abstract:
- lang: eng
text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive
over time at their release times and are to be scheduled on a single machine so
as to minimize the maximum flow time.The machine requires a setup taking $s$ time
units whenever it switches from processing jobs of one type to jobs of a different
type.We consider the problem as an online problem where each job is only known
to the scheduler as soon as it arrives and where the processing time of a job
only becomes known upon its completion (non-clairvoyance).We are interested in
the potential of simple ``greedy-like'' algorithms.We analyze a modification of
the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which
is optimal for the considered class of algorithms.For $k=2$ types it achieves
a constant competitiveness.Our main insight is obtained by an analysis of the
smoothed competitiveness.If processing times $p_j$ are independently perturbed
to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2
n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with
standard deviation $\sigma$.The result proves that bad instances are fragile and
``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787.
Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.
In Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture
Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max
Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6},
booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222},
collection={Lecture Notes in Computer Science} }'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine
with Setup Times.” In Proceedings of the 15th Workshop on Approximation and
Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science.
Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant
Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017,
vol. 10787, pp. 207–222.
mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow
Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation
and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer,
2017, pp. 207–222.'
date_created: 2017-10-17T12:41:06Z
date_updated: 2022-01-06T07:03:47Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89441-6
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:59:22Z
date_updated: 2018-11-02T14:59:22Z
file_id: '5289'
file_name: Non-clairvoyantSchedulingToMin.pdf
file_size: 380629
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:59:22Z
has_accepted_license: '1'
intvolume: ' 10787'
language:
- iso: eng
page: 207-222
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms
(WAOA)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup
Times
type: conference
user_id: '477'
volume: 10787
year: '2017'
...
---
_id: '82'
abstract:
- lang: eng
text: Many graph problems such as maximum cut, chromatic number, hamiltonian cycle,
and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized
by the treewidth of the input graphs, but become W-hard with respect to the clique-width
parameter. Recently, Gajarský et al. proposed a new parameter called modular-width
using the notion of modular decomposition of graphs. They showed that the chromatic
number problem and the partitioning into paths problem, and hence hamiltonian
path and hamiltonian cycle, are FPT when parameterized by this parameter. In this
paper, we study modular-width in parameterized parallel complexity and show that
the weighted maximum clique problem and the maximum matching problem are fixed-parameter
parallel-tractable (FPPT) when parameterized by this parameter.
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. Modular-Width:
An Auxiliary Parameter for Parameterized Parallel Complexity. In: Proceedings
of the 11th International Workshop on Frontiers in Algorithmics (FAW). LNCS.
; 2017:139-150. doi:10.1007/978-3-319-59605-1_13'
apa: 'Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.
In Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13'
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017,
series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized
Parallel Complexity}, DOI={10.1007/978-3-319-59605-1_13},
booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150},
collection={LNCS} }'
chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for
Parameterized Parallel Complexity.” In Proceedings of the 11th International
Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017. https://doi.org/10.1007/978-3-319-59605-1_13.'
ieee: 'F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,”
in Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW), 2017, pp. 139–150.'
mla: 'Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized
Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers
in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.'
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics
(FAW), 2017, pp. 139–150.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:52Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-59605-1_13
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:07:35Z
date_updated: 2018-11-02T15:07:35Z
file_id: '5294'
file_name: Modular-WidthAnAuxiliaryParame.pdf
file_size: 238276
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:07:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 139-150
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 11th International Workshop on Frontiers in Algorithmics
(FAW)
series_title: LNCS
status: public
title: 'Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '59'
abstract:
- lang: eng
text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily
divisible resource. In addition to assigning jobs to processors, the scheduler
must distribute the resource among the processors (e.g., for three processors
in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each
job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j
> 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource.
But providing them with a fraction of the resource requirement causes a linear
decrease in the processing efficiency. We seek a (non-preemptive) job and resource
assignment minimizing the makespan.Our main result is an efficient approximation
algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved
to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms
also imply new results for a well-known bin packing problem with splittable items
and a restricted number of allowed item parts per bin.Based upon the above solution,
we also derive an approximation algorithm with similar guarantees for a setting
in which we introduce so-called tasks each containing several jobs and where we
are interested in the average completion time of tasks (a task is completed when
all its jobs are completed).
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor
Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578'
apa: 'Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is
Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 123--132). https://doi.org/10.1145/3087556.3087578'
bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring:
Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578},
booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers,
Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }'
chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik.
“Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings
of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
123--132, 2017. https://doi.org/10.1145/3087556.3087578.'
ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor
Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.'
mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a
Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in
Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.'
short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp.
123--132.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/3087556.3087578
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:17:33Z
date_updated: 2018-03-21T13:17:33Z
file_id: '1578'
file_name: 59-progress.pdf
file_size: 784867
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:17:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 123--132
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '70'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- 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: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online
Leasing. In: Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA). ; 2017:17-31. doi:10.1007/978-3-319-71147-8_2'
apa: Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations
in Online Leasing. In Proceedings of the 11th Annual International Conference
on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2
bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price
Fluctuations in Online Leasing}, DOI={10.1007/978-3-319-71147-8_2},
booktitle={Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }'
chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Price Fluctuations in Online Leasing.” In Proceedings of the 11th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 17–31,
2017. https://doi.org/10.1007/978-3-319-71147-8_2.
ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations
in Online Leasing,” in Proceedings of the 11th Annual International Conference
on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.
mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings
of the 11th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2.
short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
11th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2017, pp. 17–31.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:26Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-71147-8_2
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:06:13Z
date_updated: 2018-11-02T15:06:13Z
file_id: '5293'
file_name: PriceFluctuationInOnlineLeasin.pdf
file_size: 287315
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:06:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 17 - 31
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 11th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Price Fluctuations in Online Leasing
type: conference
user_id: '477'
year: '2017'
...
---
_id: '703'
author:
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: Podlipyan P. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230
apa: Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230
bibtex: '@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering
Problem}, DOI={10.17619/UNIPB/1-230},
publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }'
chicago: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230.
ieee: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017.
mla: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem.
Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230.
short: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität
Paderborn, 2017.
date_created: 2017-11-14T14:13:21Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-230
language:
- iso: eng
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: https://doi.org/10.17619/UNIPB/1-230
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local Algorithms for the Continuous Gathering Problem
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '704'
author:
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Riechers S. Scheduling with Scarce Resources. Universität Paderborn;
2017. doi:10.17619/UNIPB/1-231
apa: Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn.
https://doi.org/10.17619/UNIPB/1-231
bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität
Paderborn}, author={Riechers, Sören}, year={2017} }'
chicago: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017. https://doi.org/10.17619/UNIPB/1-231.
ieee: S. Riechers, Scheduling with Scarce Resources. Universität Paderborn,
2017.
mla: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn,
2017, doi:10.17619/UNIPB/1-231.
short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
date_created: 2017-11-15T07:51:07Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-231
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-11-14T15:18:37Z
date_updated: 2018-11-14T15:18:37Z
file_id: '5673'
file_name: thesisStable.pdf
file_size: 1491627
relation: main_file
success: 1
file_date_updated: 2018-11-14T15:18:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
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 with Scarce Resources
type: dissertation
user_id: '14052'
year: '2017'
...
---
_id: '706'
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194.
doi:10.1007/s10878-017-0198-x
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017).
Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial
Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x
bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient
Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm
and Riechers, Sören}, year={2017}, pages={1168–1194} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal
of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.'
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization,
vol. 36, no. 4, pp. 1168–1194, 2017.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017,
pp. 1168–94, doi:10.1007/s10878-017-0198-x.
short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of
Combinatorial Optimization 36 (2017) 1168–1194.
date_created: 2017-11-15T10:21:34Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10878-017-0198-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T12:21:34Z
date_updated: 2018-03-14T12:21:34Z
file_id: '1210'
file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-03-14T12:21:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
page: 1168-1194
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: journal_article
user_id: '15415'
volume: 36
year: '2017'
...