---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '17655'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
- first_name: C.M.
full_name: Jonker, C.M.
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In:
Proceedings of the 2016 European Conference on Artificial Intelligence.
Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications.
; 2016:417-425. doi:10.3233/978-1-61499-672-9-417'
apa: 'Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation
Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence
(Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417'
bibtex: '@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial
Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume
285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417},
booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence},
author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425},
collection={Frontiers in Artificial Intelligence and Applications} }'
chicago: 'Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation
Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence,
Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications,
2016. https://doi.org/10.3233/978-1-61499-672-9-417.'
ieee: 'G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation
Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence,
2016, vol. Volume 285: ECAI 2016, pp. 417–425.'
mla: 'Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of
the 2016 European Conference on Artificial Intelligence, vol. Volume 285:
ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.'
short: 'G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European
Conference on Artificial Intelligence, 2016, pp. 417–425.'
date_created: 2020-08-06T15:20:30Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.3233/978-1-61499-672-9-417
extern: '1'
keyword:
- agents
- action
- repeated reciprocation
- fixed
- floating
- network
- Nash equilibrium
- social welfare
- price of anarchy
- price of stability
- convex combination
language:
- iso: eng
page: 417-425
publication: Proceedings of the 2016 European Conference on Artificial Intelligence
series_title: Frontiers in Artificial Intelligence and Applications
status: public
title: The Game of Reciprocation Habits
type: conference
user_id: '83983'
volume: 'Volume 285: ECAI 2016'
year: '2016'
...
---
_id: '17656'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Mathijs
full_name: de Weerdt, Mathijs
last_name: de Weerdt
- first_name: Catholijn
full_name: Jonker, Catholijn
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings
of the 2016 International Conference on Autonomous Agents and Multiagent Systems.
AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent
Systems; 2016:1431-1432.'
apa: 'Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation.
In Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation
for Autonomous Agents and Multiagent Systems.'
bibtex: '@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS
’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the
2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International
Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb
and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432},
collection={AAMAS ’16} }'
chicago: 'Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence
of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous
Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems, 2016.'
ieee: G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,”
in Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems, 2016, pp. 1431–1432.
mla: Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of
the 2016 International Conference on Autonomous Agents and Multiagent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp.
1431–32.
short: 'G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International
Conference on Autonomous Agents and Multiagent Systems, International Foundation
for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.'
date_created: 2020-08-06T15:20:45Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agent's influence
- behavior
- convergence
- perron-frobenius
- reciprocal interaction
- repeated reciprocation
language:
- iso: eng
page: 1431-1432
place: Richland, SC
publication: Proceedings of the 2016 International Conference on Autonomous Agents
and Multiagent Systems
publication_identifier:
isbn:
- 978-1-4503-4239-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '16
status: public
title: The Convergence of Reciprocation
type: conference
user_id: '83983'
year: '2016'
...
---
_id: '177'
abstract:
- lang: eng
text: 'Efficiently parallelizable parameterized problems have been classified as
being either in the class FPP (fixed-parameter parallelizable) or the class PNC
(parameterized analog of NC), which contains FPP as a subclass. In this paper,
we propose a more restrictive class of parallelizable parameterized problems called
fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should
possess an efficient parallel algorithm not only from a theoretical standpoint
but in practice as well. The primary distinction between FPPT and FPP is the parallel
processor utilization, which is bounded by a polynomial function in the case of
FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem.
In particular, we present a parallel algorithm that outperforms the best known
parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors,
the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number
of edges, n is the number of vertices of the input graph, and k is an upper bound
of the size of the sought vertex cover. We also note that a few P-complete problems
fall into FPPT including the monotone circuit value problem (MCV) when the underlying
graphs are bounded by a constant Euler genus.'
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. On the
Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35'
apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan,
P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem.
In Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35
bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016,
series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex
Cover Problem}, DOI={10.1007/978-3-319-48749-6_35},
booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016},
pages={477–488}, collection={LNCS} }'
chicago: Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity
and the Vertex Cover Problem.” In Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_35.
ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
“On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings
of the 10th International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 477–488.
mla: Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and
the Vertex Cover Problem.” Proceedings of the 10th International Conference
on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88,
doi:10.1007/978-3-319-48749-6_35.
short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
in: Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 477–488.'
date_created: 2017-10-17T12:41:26Z
date_updated: 2022-01-06T06:53:17Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:15:18Z
date_updated: 2018-11-02T14:15:18Z
file_id: '5266'
file_name: OnTheParameterizedParallelComp.pdf
file_size: 293345
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:15:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 477-488
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th International Conference on Combinatorial Optimization
and Applications (COCOA)
series_title: LNCS
status: public
title: On the Parameterized Parallel Complexity and the Vertex Cover Problem
type: conference
user_id: '477'
year: '2016'
...
---
_id: '187'
citation:
ama: Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.;
2016. doi:10.1145/2936716
apa: Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue
on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716
bibtex: '@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue
on SPAA 2014}, DOI={10.1145/2936716},
number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }'
chicago: Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue
on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.
ieee: F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA
2014, no. 1. 2016.
mla: Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue
on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016,
doi:10.1145/2936716.
short: F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014,
2016.
date_created: 2017-10-17T12:41:28Z
date_updated: 2022-01-06T06:53:51Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2936716
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:31:42Z
date_updated: 2018-03-21T12:31:42Z
file_id: '1531'
file_name: 187-a1-heide.pdf
file_size: 34053
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:31:42Z
has_accepted_license: '1'
issue: '1'
page: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Parallel Computing (TOPC)
status: public
title: Introduction to the Special Issue on SPAA 2014
type: journal_editor
user_id: '15504'
year: '2016'
...
---
_id: '207'
abstract:
- lang: eng
text: We consider a scheduling problem where machines need to be rented from the
cloud in order to process jobs. There are two types of machines available which
can be rented for machine-type dependent prices and for arbitrary durations. However,
a machine-type dependent setup time is required before a machine is available
for processing. Jobs arrive online over time, have machine-type dependent sizes
and have individual deadlines. The objective is to rent machines and schedule
jobs so as to meet all deadlines while minimizing the rental cost. Since we observe
the slack of jobs to have a fundamental influence on the competitiveness, we study
the model when instances are parameterized by their (minimum) slack. An instance
is called to have a slack of $\beta$ if, for all jobs, the difference between
the job's release time and the latest point in time at which it needs to be started
is at least $\beta$. While for $\beta series = {LNCS}
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592.
doi:10.1007/978-3-319-48749-6_42'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592}
}'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp.
578--592.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 578--592.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:33Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_42
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:18:51Z
date_updated: 2018-11-02T14:18:51Z
file_id: '5268'
file_name: Cost-EfficientSchedulingOnMach.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:18:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 578--592
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: conference
user_id: '477'
year: '2016'
...
---
_id: '209'
abstract:
- lang: eng
text: We study a new class of games which generalizes congestion games and its bottleneck
variant. We introduce congestion games with mixed objectives to model network
scenarios in which players seek to optimize for latency and bandwidths alike.
We characterize the existence of pure Nash equilibria (PNE) and the convergence
of improvement dynamics. For games that do not possess PNE we give bounds on the
approximation 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. In:
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47'
apa: Feldotto, M., Leder, L., & Skopalik, A. (2016). Congestion Games with Mixed
Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA) (pp. 655--669). https://doi.org/10.1007/978-3-319-48749-6_47
bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion
Games with Mixed Objectives}, DOI={10.1007/978-3-319-48749-6_47},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder,
Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS}
}'
chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion
Games with Mixed Objectives.” In Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 655--669.
LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.
ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,”
in Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2016, pp. 655--669.
mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.
short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:41Z
ddc:
- '000'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_47
external_id:
arxiv:
- '1607.05143'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T17:03:44Z
date_updated: 2018-10-31T17:03:44Z
file_id: '5233'
file_name: Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf
file_size: 235739
relation: main_file
success: 1
file_date_updated: 2018-10-31T17:03:44Z
has_accepted_license: '1'
language:
- iso: eng
page: 655--669
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Congestion Games with Mixed Objectives
type: conference
user_id: '14052'
year: '2016'
...
---
_id: '5406'
author:
- first_name: Jonas
full_name: Bülling, Jonas
last_name: Bülling
citation:
ama: Bülling J. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen
Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.; 2016.
apa: Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse
von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.
bibtex: '@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse
von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden},
author={Bülling, Jonas}, year={2016} }'
chicago: Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse
von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden,
2016.
ieee: J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von
Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.
2016.
mla: Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse
von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.
2016.
short: J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen
Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.
date_created: 2018-11-07T09:26:42Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen
zur Verifizierung der Ausbreitung von Eichenkomplexschäden
type: bachelorsthesis
user_id: '22704'
year: '2016'
...
---
_id: '5407'
author:
- first_name: Jörn
full_name: Koepe, Jörn
last_name: Koepe
citation:
ama: Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.
apa: Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.
bibtex: '@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität
Paderborn}, author={Koepe, Jörn}, year={2016} }'
chicago: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn,
2016.
ieee: J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.
mla: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.
short: J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.
date_created: 2018-11-07T09:45:57Z
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: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
title: Price-Based Allocation Games
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '688'
author:
- first_name: Damian
full_name: Kutzias, Damian
last_name: Kutzias
citation:
ama: Kutzias D. Friendship Processes in Network Creation Games. Universität
Paderborn; 2016.
apa: Kutzias, D. (2016). Friendship Processes in Network Creation Games.
Universität Paderborn.
bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games},
publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }'
chicago: Kutzias, Damian. Friendship Processes in Network Creation Games.
Universität Paderborn, 2016.
ieee: D. Kutzias, Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
mla: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität
Paderborn, 2016.
short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn,
2016.
date_created: 2017-11-14T06:50:35Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
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: Friendship Processes in Network Creation Games
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '689'
author:
- first_name: Johannes Sebastian
full_name: Schaefer, Johannes Sebastian
id: '30291'
last_name: Schaefer
citation:
ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn; 2016.
apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster
Management Support. Universität Paderborn.
bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for
Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer,
Johannes Sebastian}, year={2016} }'
chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks
for Disaster Management Support. Universität Paderborn, 2016.
ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support. Universität Paderborn, 2016.
mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for
Disaster Management Support. Universität Paderborn, 2016.
short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
Support, Universität Paderborn, 2016.
date_created: 2017-11-14T06:51:37Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
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: Routing Algorithms on Delayed Networks for Disaster Management Support
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '16450'
abstract:
- lang: eng
text: "In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable,
point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time
$\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given
an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem
on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is
not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal
neighbors on the grid. The\r\nlocality constraint means that no global control,
no compass, no global\r\ncommunication and only local vision is available; hence,
a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which
also limits its\r\nmovements. A robot can move to one of its eight neighboring
grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged}
to be only\r\none robot. The locality constraint is the significant challenging
issue here,\r\nsince robot movements must not harm the (only globally checkable)
swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm
-- executed by every robot -- which ensures that robots merge without\r\nbreaking
the swarm connectivity. In our model, robots can obtain a special\r\nstate, which
marks such a robot to be performing specific connectivity\r\npreserving movements
in order to allow later merge operations of the swarm.\r\nCompared to the grid,
for gathering in the Euclidean plane for the same robot\r\nand time model the
best known upper bound is $\\mathcal{O}(n^2)$."
author:
- first_name: 'Andreas '
full_name: 'Cord-Landwehr, Andreas '
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal
Gathering on a Grid. arXiv:160203303. 2016.
apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016).
Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303.
bibtex: '@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr,
Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm},
year={2016} }'
chicago: Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer
auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303,
2016.
ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
Optimal Gathering on a Grid,” arXiv:1602.03303. 2016.
mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
ArXiv:1602.03303, 2016.
short: A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303
(2016).
date_created: 2020-04-07T07:20:47Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1602.03303'
language:
- iso: eng
publication: arXiv:1602.03303
status: public
title: Asymptotically Optimal Gathering on a Grid
type: preprint
user_id: '15415'
year: '2016'
...
---
_id: '169'
abstract:
- lang: eng
text: We apply methods of genetic programming to a general problem from software
engineering, namely example-based generation of specifications. In particular,
we focus on model transformation by example. The definition and implementation
of model transformations is a task frequently carried out by domain experts, hence,
a (semi-)automatic approach is desirable. This application is challenging because
the underlying search space has rich semantics, is high-dimensional, and unstructured.
Hence, a computationally brute-force approach would be unscalable and potentially
infeasible. To address that problem, we develop a sophisticated approach of designing
complex mutation operators. We define ‘patterns’ for constructing mutation operators
and report a successful case study. Furthermore, the code of the evolved model
transformation is required to have high maintainability and extensibility, that
is, the code should be easily readable by domain experts. We report an evaluation
of this approach in a software engineering case study.
author:
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation
Operators: Limiting the Search Space in a Software Engineering Application. In:
Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18'
apa: 'Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for
Constructing Mutation Operators: Limiting the Search Space in a Software Engineering
Application. In Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18'
bibtex: '@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594},
title={Patterns for Constructing Mutation Operators: Limiting the Search Space
in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18},
booktitle={Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana
and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }'
chicago: 'Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns
for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering
Application.” In Proceedings of the 19th European Conference on Genetic Programming
(EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.'
ieee: 'T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing
Mutation Operators: Limiting the Search Space in a Software Engineering Application,”
in Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016), 2016, pp. 278--293.'
mla: 'Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting
the Search Space in a Software Engineering Application.” Proceedings of the
19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293,
doi:10.1007/978-3-319-30668-1_18.'
short: 'T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th
European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.'
date_created: 2017-10-17T12:41:25Z
date_updated: 2022-01-06T06:52:58Z
ddc:
- '040'
department:
- _id: '66'
- _id: '238'
- _id: '63'
doi: 10.1007/978-3-319-30668-1_18
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:41:08Z
date_updated: 2018-03-21T12:41:08Z
file_id: '1540'
file_name: 169-kuehne.pdf
file_size: 2069427
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:41:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 278--293
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP
2016)
series_title: LNCS 9594
status: public
title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in
a Software Engineering Application'
type: conference
user_id: '57458'
year: '2016'
...
---
_id: '1082'
author:
- first_name: Tobias
full_name: Handirk, Tobias
last_name: Handirk
citation:
ama: Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität
Paderborn; 2016.
apa: Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn.
bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken},
publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }'
chicago: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
ieee: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
mla: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken.
Universität Paderborn, 2016.
short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität
Paderborn, 2016.
date_created: 2017-12-19T10:10:17Z
date_updated: 2022-01-06T06:50:51Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Über die Rolle von Informationen in Verkehrsnetzwerken
type: bachelorsthesis
user_id: '14052'
year: '2016'
...
---
_id: '154'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
citation:
ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation
Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2016.
apa: Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network
Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network
Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network
Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2016.
short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:23Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:52:03Z
date_updated: 2018-03-21T12:52:03Z
file_id: '1551'
file_name: 154-dissertation.pdf
file_size: 800101
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:52:03Z
has_accepted_license: '1'
intvolume: ' 353'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication_identifier:
isbn:
- 978-3-942647-72-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Selfish Network Creation - On Variants of Network Creation Games
type: dissertation
user_id: '5786'
volume: 353
year: '2016'
...
---
_id: '157'
abstract:
- lang: eng
text: Consider a scheduling problem in which a set of jobs with interjob communication,
canonically represented by a weighted tree, needs to be scheduled on m parallel
processors interconnected by a shared communication channel. In each time step,
we may allow any processed job to use a certain capacity of the channel in order
to satisfy (parts of) its communication demands to adjacent jobs processed in
parallel. The goal is to find a schedule that minimizes the makespan and in which
communication demands of all jobs are satisfied.We show that this problem is NP-hard
in the strong sense even if the number of processors and the maximum degree of
the underlying tree is constant.Consequently, we design and analyze simple approximation
algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio
of 5/2 in case of arbitrary trees.
author:
- first_name: Jürgen
full_name: König, Jürgen
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. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2016:563--577. doi:10.1007/978-3-319-48749-6_41'
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016).
Scheduling with Interjob Communication on Parallel Processors. In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41
bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS},
title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577},
collection={LNCS} }'
chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41.
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with Interjob Communication on Parallel Processors,” in Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 563--577.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 563--577.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_41
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:50:29Z
date_updated: 2018-03-21T12:50:29Z
file_id: '1549'
file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf
file_size: 753147
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:50:29Z
has_accepted_license: '1'
page: 563--577
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Scheduling with Interjob Communication on Parallel Processors
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '159'
abstract:
- lang: eng
text: Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation
of bandwidth to each of the usersin a network. This allocation can be computed
by uniformlyraising the bandwidths of all users without violating capacityconstraints.
We consider an extension of these allocations byraising the bandwidth with arbitrary
and not necessarily uniformtime-depending velocities (allocation rates). These
allocationsare used in a game-theoretic context for routing choices, whichwe formalize
in progressive filling games (PFGs). We present avariety of results for equilibria
in PFGs. We show that these gamespossess pure Nash and strong equilibria. While
computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent
classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the
same source-destination pair.We characterize prices of anarchy and stability for
pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or
the same source-destination pairs. In addition, weshow that when a designer can
adjust allocation rates, it is possibleto design games with optimal strong equilibria.
Some initial resultson polynomial-time algorithms in this direction are also derived.
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling.
IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games
With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562.
https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With
Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks,
Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016},
pages={2553–2562} }'
chicago: 'Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no.
4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.'
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive
Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.
mla: Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM
Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
short: T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking
(2016) 2553–2562.
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:40Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:48:02Z
date_updated: 2018-03-21T12:48:02Z
file_id: '1547'
file_name: 159-Harks-Hoefer-Schewior-Skopalik2016.pdf
file_size: 1655309
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:48:02Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 2553 - 2562
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: IEEE/ACM Transactions on Networking
publisher: IEEE
status: public
title: Routing Games With Progressive Filling
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '149'
abstract:
- lang: eng
text: 'In this paper we consider a strategic variant of the online facility location
problem. Given is a graph in which each node serves two roles: it is a strategic
client stating requests as well as a potential location for a facility. In each
time step one client states a request which induces private costs equal to the
distance to the closest facility. Before serving, the clients may collectively
decide to open new facilities, sharing the corresponding price. Instead of optimizing
the global costs, each client acts selfishly. The prices of new facilities vary
between nodes and also change over time, but are always bounded by some fixed
value α. Both the requests as well as the facility prices are given by an online
sequence and are not known in advance.We characterize the optimal strategies of
the clients and analyze their overall performance in comparison to a centralized
offline solution. If all players optimize their own competitiveness, the global
performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
to a natural subclass of strategies improves this result to O(α). We also show
that for fixed facility costs, we can find strategies such that this bound further
improves to O(√α).'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43'
apa: Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility
Location. In Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43
bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
}'
chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
Facility Location.” In Proceedings of the 10th Annual International Conference
on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016.
https://doi.org/10.1007/978-3-319-48749-6_43.
ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
in Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2016, pp. 593--607.
mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:55:43Z
date_updated: 2018-03-21T12:55:43Z
file_id: '1553'
file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
file_size: 236253
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '163'
citation:
ama: Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016.
doi:10.1145/2942358
apa: 'Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358'
bibtex: '@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th
ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)},
DOI={10.1145/2942358}, publisher={ACM},
year={2016} }'
chicago: Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358.
ieee: F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM
International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
ACM, 2016.
mla: Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016, doi:10.1145/2942358.
short: F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.
conference:
end_date: 2016-07-08
location: Paderborn, Germany
name: MobiHoc
start_date: 2016-07-04
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1145/2942358
editor:
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: ACM
status: public
title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking
and Computing (MobiHoc)
type: conference_editor
user_id: '15504'
year: '2016'
...
---
_id: '16351'
abstract:
- lang: eng
text: "Defining, measuring, and comparing the quality and efficiency of rendering
algorithms in computer graphics is a demanding challenge: quality measures are
often application specific and efficiency is strongly influenced by properties
of the rendered scene and the used hardware. We survey the currently employed
evaluation methods for AQ1 the development process of rendering algorithms. Then,
we present our PADrend framework, which supports systematic and flexible development,
evaluation, adaptation, and comparison of rendering algorithms, and provides a
comfortable and easy-to-use platform for developers of rendering algorithms. The
system includes a new evaluation method to improve the objectivity of experimental
evaluations of rendering algorithms.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
citation:
ama: 'Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering
Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm
Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 '
apa: Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm
Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P.
Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer.
https://doi.org/10.1007/978-3-319-49487-6_7
bibtex: '@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS},
title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220},
DOI={10.1007/978-3-319-49487-6_7
}, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer,
Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf},
editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244},
collection={LNCS} }'
chicago: Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf
Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In
Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44.
LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7
.
ieee: M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering
Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016,
vol. 9220, pp. 226–244.
mla: Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering
Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter
Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 .
short: 'M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann,
P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.'
date_created: 2020-03-30T10:21:53Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: '10.1007/978-3-319-49487-6_7 '
editor:
- first_name: Lasse
full_name: Kliemann, Lasse
last_name: Kliemann
- first_name: Peter
full_name: Sanders, Peter
last_name: Sanders
intvolume: ' 9220'
language:
- iso: eng
page: 226-244
publication: Algorithm Engineering
publisher: Springer
series_title: LNCS
status: public
title: Algorithm Engineering Aspects of Real-Time Rendering Algorithms
type: conference
user_id: '15415'
volume: 9220
year: '2016'
...