---
_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:
    <i>Distributed Computing by Mobile Entities, Current Research in Moving and Computing</i>.
    Vol 11340. Lecture Notes in Computer Science. Springer; 2019:317-334. doi:<a href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>'
  apa: Kling, P., &#38; Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm
    Robotics. In <i>Distributed Computing by Mobile Entities, Current Research in
    Moving and Computing</i> (Vol. 11340, pp. 317–334). Springer. <a href="https://doi.org/10.1007/978-3-030-11072-7\_13">https://doi.org/10.1007/978-3-030-11072-7\_13</a>
  bibtex: '@inbook{Kling_Meyer auf der Heide_2019, series={Lecture Notes in Computer
    Science}, title={Continuous Protocols for Swarm Robotics}, volume={11340}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>},
    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 <i>Distributed Computing by Mobile Entities, Current Research
    in Moving and Computing</i>, 11340:317–34. Lecture Notes in Computer Science.
    Springer, 2019. <a href="https://doi.org/10.1007/978-3-030-11072-7\_13">https://doi.org/10.1007/978-3-030-11072-7\_13</a>.
  ieee: P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,”
    in <i>Distributed Computing by Mobile Entities, Current Research in Moving and
    Computing</i>, vol. 11340, Springer, 2019, pp. 317–334.
  mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for
    Swarm Robotics.” <i>Distributed Computing by Mobile Entities, Current Research
    in Moving and Computing</i>, vol. 11340, Springer, 2019, pp. 317–34, doi:<a href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>.
  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: <i>Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321.
    doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>'
  apa: Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for
    Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>
    (pp. 315–321). SciTePress. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms
    for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>},
    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 <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    315–21. SciTePress, 2019. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>.
  ieee: C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex
    Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th
    International Conference on Operations Research and Enterprise Systems</i>, 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.” <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    SciTePress, 2019, pp. 315–21, doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>.
  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. <i>Theoretical Computer Science</i>.
    2019;786:2-12. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>
  apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan,
    P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical
    Computer Science</i>, <i>786</i>, 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>
  bibtex: '@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient
    parallel algorithms for parameterized problems}, volume={786}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>},
    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.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>.'
  ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
    “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer
    Science</i>, vol. 786, pp. 2–12, 2019.
  mla: Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>.
  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: <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>.
    ; 2019:345-348. doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>'
  apa: Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of
    the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>
  bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>},
    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 <i>Proceedings
    of the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i>, 345–48, 2019. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>.
  ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
    Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>,
    L’Aquila, Italy, 2019, pp. 345–348.
  mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
    Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium
    on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp.
    345–48, doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>.
  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: <i>Proceedings
    of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>.
    International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.'
  apa: 'Feldotto, M., Lenzner, P., Molitor, L., &#38; Skopalik, A. (2019).  From Hotelling
    to Load Balancing: Approximation and the Principle of Minimum Differentiation.
    In <i>Proceedings of the 18th International Conference on Autonomous Agents and
    MultiAgent Systems</i> (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 <i>Proceedings of the 18th International Conference on Autonomous
    Agents and MultiAgent Systems</i>, 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
    <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent
    Systems</i>, Montreal QC, Canada, 2019, pp. 1949--1951.'
  mla: 'Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation
    and the Principle of Minimum Differentiation.” <i>Proceedings of the 18th International
    Conference on Autonomous Agents and MultiAgent Systems</i>, 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. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn; 2019.
  apa: Pukrop, S. (2019). <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. 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. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn, 2019.
  ieee: S. Pukrop, <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn, 2019.
  mla: Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. 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. <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>.
    Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
    Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a
    href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>'
  apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
    S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
    I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>
    (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>'
  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={<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>},
    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 <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, 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. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.'
  ieee: B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,”
    in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.
  mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
    <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>.
  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: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
    Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>'
  apa: 'Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location
    with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>'
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
    Location with Mobile Facilities}, DOI={<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>},
    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 <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
    Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>.
  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. <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>.; 2018.
  apa: Liedtke, D. J. (2018). <i>Influence of Stationary Robots on Continuous Robot
    Formation Problems</i>.
  bibtex: '@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous
    Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }'
  chicago: Liedtke, David Jan. <i>Influence of Stationary Robots on Continuous Robot
    Formation Problems</i>, 2018.
  ieee: D. J. Liedtke, <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>. 2018.
  mla: Liedtke, David Jan. <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>. 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. <i>arXiv:180502994</i>.
    2018.
  apa: Markarian, C. (2018). Online Connected Dominating Set Leasing. <i>ArXiv:1805.02994</i>.
  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.” <i>ArXiv:1805.02994</i>,
    2018.
  ieee: C. Markarian, “Online Connected Dominating Set Leasing,” <i>arXiv:1805.02994</i>.
    2018.
  mla: Markarian, Christine. “Online Connected Dominating Set Leasing.” <i>ArXiv:1805.02994</i>,
    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: <i>Proceedings of the 13th Workshop on Economics
    of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a
    href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>'
  apa: Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating
    User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop
    on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6).
    Irvine, California, USA. <a href="https://doi.org/10.1145/3230654.3230659">https://doi.org/10.1145/3230654.3230659</a>
  bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
    User Evaluations Using the Shapley Value}, DOI={<a href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>},
    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 <i>Proceedings of
    the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>,
    5:1-5:6, 2018. <a href="https://doi.org/10.1145/3230654.3230659">https://doi.org/10.1145/3230654.3230659</a>.
  ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
    User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop
    on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine,
    California, USA, 2018, pp. 5:1-5:6.
  mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
    Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems
    and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href="https://doi.org/10.1145/3230654.3230659">10.1145/3230654.3230659</a>.
  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. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>
  apa: Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible
    Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574.
    <a href="https://doi.org/10.1007/s00453-018-0420-y">https://doi.org/10.1007/s00453-018-0420-y</a>
  bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
    Demands in Online Leasing Problems. }, volume={80}, DOI={<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>},
    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. .” <i>Algorithmica</i> 80, no. 5
    (2018): 1556–1574. <a href="https://doi.org/10.1007/s00453-018-0420-y">https://doi.org/10.1007/s00453-018-0420-y</a>.'
  ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
    in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574,
    2018.
  mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
    <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>.
  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.
    <i>Theory of Computing Systems</i>. 2018. doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>
  apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M.
    (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
    Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>
  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={<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>},
    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.” <i>Theory of Computing Systems</i>, 2018. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>.
  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,”
    <i>Theory of Computing Systems</i>, 2018.
  mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
    Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>,
    Springer, 2018, doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>.
  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, &#38; Survive:
    Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
    In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018.
    doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>'
  apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018).
    Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online
    Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>'
  bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
    Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets}, DOI={<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>},
    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, &#38; Survive: Charging Robots in a Modern Warehouse
    Based on Online Connected Dominating Sets.” In <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.'
  ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
    &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>, 2018.'
  mla: 'Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern
    Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018, doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>.'
  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: <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>.
    ; 2018. doi:<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>'
  apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest. <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>.
    <a href="https://doi.org/10.1007/978-3-319-94667-2_18">https://doi.org/10.1007/978-3-319-94667-2_18</a>
  bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm
    for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>},
    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 <i>International Workshop on Combinatorial Algorithms
    (IWOCA)</i>. Cham, 2018. <a href="https://doi.org/10.1007/978-3-319-94667-2_18">https://doi.org/10.1007/978-3-319-94667-2_18</a>.
  ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest,” 2018, doi: <a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>.'
  mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted
    Steiner Forest.” <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>,
    2018, doi:<a href="https://doi.org/10.1007/978-3-319-94667-2_18">10.1007/978-3-319-94667-2_18</a>.
  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. <i>Journal of Combinatorial Optimization</i>.
    2018;36(4):1356-1379. doi:<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>
  apa: König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018).
    Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial
    Optimization</i>, <i>36</i>(4), 1356–1379. <a href="https://doi.org/10.1007/s10878-018-0325-3">https://doi.org/10.1007/s10878-018-0325-3</a>
  bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
    with interjob communication on parallel processors}, volume={36}, DOI={<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>},
    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.” <i>Journal
    of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href="https://doi.org/10.1007/s10878-018-0325-3">https://doi.org/10.1007/s10878-018-0325-3</a>.'
  ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
    with interjob communication on parallel processors,” <i>Journal of Combinatorial
    Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.
  mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
    <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79,
    doi:<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>.
  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. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn;
    2018.
  apa: Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. 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. <i>Congestion Games mit gewichteten Strategien</i>. Universität
    Paderborn, 2018.
  ieee: S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn,
    2018.
  mla: Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. 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. <i>Combinatorial Optimization
    and Applications</i>. Cham: Springer International Publishing; 2018:217-232.'
  apa: 'Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2018). Removing
    Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &#38; A. Zelikovsky
    (Eds.), <i>Combinatorial Optimization and Applications</i> (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 <i>Combinatorial Optimization and Applications</i>,
    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 <i>Combinatorial Optimization and Applications</i>,
    2018, pp. 217–232.
  mla: Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” <i>Combinatorial
    Optimization and Applications</i>, 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.
    <i>Future Generation Computer Systems</i>. 2018. doi:<a href="https://doi.org/10.1016/j.future.2018.08.011">https://doi.org/10.1016/j.future.2018.08.011</a>
  apa: Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &#38; Grosso,
    P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer
    infrastructures. <i>Future Generation Computer Systems</i>. <a href="https://doi.org/10.1016/j.future.2018.08.011">https://doi.org/10.1016/j.future.2018.08.011</a>
  bibtex: '@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring
    the efficiency of SDN mitigations against attacks on computer infrastructures},
    DOI={<a href="https://doi.org/10.1016/j.future.2018.08.011">https://doi.org/10.1016/j.future.2018.08.011</a>},
    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.”
    <i>Future Generation Computer Systems</i>, 2018. <a href="https://doi.org/10.1016/j.future.2018.08.011">https://doi.org/10.1016/j.future.2018.08.011</a>.
  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,”
    <i>Future Generation Computer Systems</i>, 2018.
  mla: Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks
    on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018,
    doi:<a href="https://doi.org/10.1016/j.future.2018.08.011">https://doi.org/10.1016/j.future.2018.08.011</a>.
  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. <i>Journal of Scheduling</i>. 2018;21(1):77-92. doi:<a href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>
  apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
    Riechers, S., Sgall, J., &#38; Suess, T. (2018). Scheduling Shared Continuous
    Resources on Many-Cores. <i>Journal of Scheduling</i>, <i>21</i>(1), 77–92. <a
    href="https://doi.org/10.1007/s10951-017-0518-0">https://doi.org/10.1007/s10951-017-0518-0</a>
  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={<a
    href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>},
    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.” <i>Journal of Scheduling</i> 21, no. 1 (2018):
    77–92. <a href="https://doi.org/10.1007/s10951-017-0518-0">https://doi.org/10.1007/s10951-017-0518-0</a>.'
  ieee: 'E. Althaus <i>et al.</i>, “Scheduling Shared Continuous Resources on Many-Cores,”
    <i>Journal of Scheduling</i>, vol. 21, no. 1, pp. 77–92, 2018, doi: <a href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>.'
  mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
    <i>Journal of Scheduling</i>, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:<a
    href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>.
  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'
...