---
_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'
...