---
_id: '16431'
citation:
ama: Meyer auf der Heide F, Bender MA, eds. Proceedings of the Twenty-First Annual
Symposium on Parallelism in Algorithms and Architectures - SPAA ’09.; 2009.
doi:10.1145/1583991
apa: Meyer auf der Heide, F., & Bender, M. A. (Eds.). (2009). Proceedings
of the twenty-first annual symposium on Parallelism in algorithms and architectures
- SPAA ’09. https://doi.org/10.1145/1583991
bibtex: '@book{Meyer auf der Heide_Bender_2009, title={Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, DOI={10.1145/1583991}, year={2009} }'
chicago: Meyer auf der Heide, Friedhelm, and Michael A. Bender, eds. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09, 2009. https://doi.org/10.1145/1583991.
ieee: F. Meyer auf der Heide and M. A. Bender, Eds., Proceedings of the twenty-first
annual symposium on Parallelism in algorithms and architectures - SPAA ’09.
2009.
mla: Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. Proceedings
of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures
- SPAA ’09. 2009, doi:10.1145/1583991.
short: F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First
Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.
date_created: 2020-04-06T13:55:23Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1583991
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael A.
full_name: Bender, Michael A.
last_name: Bender
language:
- iso: eng
publication_identifier:
isbn:
- '9781605586069'
publication_status: published
status: public
title: Proceedings of the twenty-first annual symposium on Parallelism in algorithms
and architectures - SPAA '09
type: conference_editor
user_id: '15415'
year: '2009'
...
---
_id: '16398'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jaroslaw
full_name: Byrka, Jaroslaw
last_name: Byrka
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms
for page migration in dynamic networks. Journal of Discrete Algorithms.
2009:545-569. doi:10.1016/j.jda.2008.07.006
apa: Bienkowski, M., Byrka, J., Korzeniowski, M., & Meyer auf der Heide, F.
(2009). Optimal algorithms for page migration in dynamic networks. Journal
of Discrete Algorithms, 545–569. https://doi.org/10.1016/j.jda.2008.07.006
bibtex: '@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal
algorithms for page migration in dynamic networks}, DOI={10.1016/j.jda.2008.07.006},
journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka,
Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009},
pages={545–569} }'
chicago: Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm
Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.”
Journal of Discrete Algorithms, 2009, 545–69. https://doi.org/10.1016/j.jda.2008.07.006.
ieee: M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal
algorithms for page migration in dynamic networks,” Journal of Discrete Algorithms,
pp. 545–569, 2009.
mla: Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic
Networks.” Journal of Discrete Algorithms, 2009, pp. 545–69, doi:10.1016/j.jda.2008.07.006.
short: M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal
of Discrete Algorithms (2009) 545–569.
date_created: 2020-04-03T10:40:45Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.jda.2008.07.006
language:
- iso: eng
page: 545-569
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal algorithms for page migration in dynamic networks
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '19615'
author:
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: Schomaker G. Distributed Resource Allocation and Management in Heterogeneous
Networks. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2008.
apa: Schomaker, G. (2008). Distributed Resource Allocation and Management in
Heterogeneous Networks (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous
Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Schomaker, Gunnar. Distributed Resource Allocation and Management in
Heterogeneous Networks. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
ieee: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2008.
mla: Schomaker, Gunnar. Distributed Resource Allocation and Management in Heterogeneous
Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
short: G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous
Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
date_created: 2020-09-22T08:10:41Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 259'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-78-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013
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: Distributed Resource Allocation and Management in Heterogeneous Networks
type: dissertation
user_id: '5786'
volume: 259
year: '2008'
...
---
_id: '19686'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
; 2008. doi:10.1007/978-3-540-70575-8_66'
apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).
https://doi.org/10.1007/978-3-540-70575-8_66
bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
Problem}, DOI={10.1007/978-3-540-70575-8_66},
booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
Proceedings of the 35th InternationalColloquium on Automata, Languages and
Programming (ICALP), 2008. https://doi.org/10.1007/978-3-540-70575-8_66.
ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008.
mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings
of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP),
2008, doi:10.1007/978-3-540-70575-8_66.
short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540705741'
- '9783540705758'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19687'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Piotr
full_name: Krysta, Piotr
last_name: Krysta
- first_name: Moshe
full_name: Babaioff, Moshe
last_name: Babaioff
citation:
ama: 'Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange
Problems. In: Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9'
apa: Briest, P., Krysta, P., & Babaioff, M. (2008). On the Approximability of
Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium
on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9
bibtex: '@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the
Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9},
booktitle={Proceedings of the 1st International Symposium on Algorithmic Game
Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe},
year={2008} }'
chicago: Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability
of Combinatorial Exchange Problems.” In Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.
ieee: P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial
Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic
Game Theory (SAGT), 2008.
mla: Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.”
Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT),
2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.
short: 'P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International
Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.'
date_created: 2020-09-25T09:49:43Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: https://doi.org/10.1007/978-3-540-79309-0_9
language:
- iso: eng
place: Cham
publication: Proceedings of the 1st International Symposium on Algorithmic Game Theory
(SAGT)
publication_status: published
status: public
title: On the Approximability of Combinatorial Exchange Problems
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19688'
abstract:
- lang: eng
text: "We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria)
in normal form games, where the number of players is a small\r\nconstant. We consider
the approach of looking for solutions with constant\r\nsupport size. It is known
from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily
found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2.
In this paper we extend those results to the\r\nk-player case, and find that epsilon
= 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results
for the 2-player case may be used\r\nin order to slightly improve upon the epsilon
= 1-1/k obtained in the k-player\r\ncase."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Paul W.
full_name: Goldberg, Paul W.
last_name: Goldberg
- first_name: Heiko
full_name: Roeglin, Heiko
last_name: Roeglin
citation:
ama: Briest P, Goldberg PW, Roeglin H. Approximate Equilibria in Games with Few
Players.; 2008.
apa: Briest, P., Goldberg, P. W., & Roeglin, H. (2008). Approximate Equilibria
in Games with Few Players.
bibtex: '@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games
with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin,
Heiko}, year={2008} }'
chicago: Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. Approximate Equilibria
in Games with Few Players, 2008.
ieee: P. Briest, P. W. Goldberg, and H. Roeglin, Approximate Equilibria in Games
with Few Players. 2008.
mla: Briest, Patrick, et al. Approximate Equilibria in Games with Few Players.
2008.
short: P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with
Few Players, 2008.
date_created: 2020-09-25T09:52:57Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
external_id:
arxiv:
- '0804.4524 '
language:
- iso: eng
status: public
title: Approximate Equilibria in Games with Few Players
type: report
user_id: '15415'
year: '2008'
...
---
_id: '19812'
abstract:
- lang: eng
text: 'Modern peer-to-peer networks consist of several network layers and distributed
algorithms providing features like indexing, resource balancing, entry protocols,
security, anonymity, and cryptography. Since peer-to-peer networks are highly
dynamic, a fundamental task in the design of these networks is to provide high
connectivity. We propose a solution by distributed random link exchange algorithms
such that the overlay network can be a connected random graph or use a random
graph as backbone. Random graphs are expander graphs have logarithmic diameter,
high node connectivity, excellent communication properties, and are expander graphs
with high probability. In summary: they are an excellent choice to improve the
stability and robustness of a dynamic network.'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: 'Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In:
The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.'
apa: Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer
Overlays. The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, 222,
1–22.
bibtex: '@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer
Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer,
Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }'
chicago: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” In The European Integrated Project "Dynamically Evolving, Large
Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
ieee: C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,”
in The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
mla: Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer
Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale
Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
short: 'C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically
Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.'
date_created: 2020-09-30T13:24:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
- _id: '26'
issue: '222'
language:
- iso: eng
page: 1-22
publication: The European Integrated Project "Dynamically Evolving, Large Scale Information
Systems (DELIS), Proceedings of the Final Workshop
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Random Graphs for Peer-to-Peer Overlays
type: conference
user_id: '5786'
year: '2008'
...
---
_id: '19813'
abstract:
- lang: eng
text: 'Autonomous robotic systems have been gaining the attention of research community
in mobile ad hoc network since the past few years. While motion cost and communications
cost constitute the primary energy consumers, each of them is investigated independently.
By taking into account the power consumption of both entities, the overall energy
efficiency of a system can be further improved. In this paper, the energy optimization
problem of radio communication and motion is examined. We consider a hybrid wireless network
that consists of a single autonomous mobile node and multiple relay nodes. The
mobile node interacts with the relays within its vicinity by continuously communicating
high-bandwidth data, e.g. triggered by a multimedia application like video surveillance.
The goal is to find the best path such that the energy consumption for both mobility
and communications is minimized. We introduce the Radio-Energy-Aware (REA) path
computation strategy by utilizing node mobility. Given the starting point, the
target point and the position of the relays, our simulation results show that
the proposed strategy improves the energy efficiency of mobile node compared to
the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. '
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks.
In: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008). Springer;
2008. doi:10.1007/978-0-387-84839-6_6'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Detours Save Energy in Mobile
Wireless Networks. In MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008). Springer. https://doi.org/10.1007/978-0-387-84839-6_6'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile
Wireless Networks}, DOI={10.1007/978-0-387-84839-6_6},
booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer},
author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in
Mobile Wireless Networks.” In MWCN’08: Proc. of IFIP Joint Conference on Mobile
Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008). Springer, 2008. https://doi.org/10.1007/978-0-387-84839-6_6.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,”
in MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile
Wireless Networks.” MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless
Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC
2008), Springer, 2008, doi:10.1007/978-0-387-84839-6_6.'
short: 'C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference
on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications
(PWC 2008), Springer, 2008.'
date_created: 2020-09-30T13:27:54Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-0-387-84839-6_6
language:
- iso: eng
publication: 'MWCN''08: Proc. of IFIP Joint Conference on Mobile Wireless Communications
Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)'
publication_identifier:
isbn:
- '9780387848389'
- '9780387848396'
issn:
- 1571-5736
publication_status: published
publisher: Springer
status: public
title: Detours Save Energy in Mobile Wireless Networks
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19832'
author:
- first_name: Chia Ching
full_name: Ooi, Chia Ching
last_name: Ooi
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using
Wireless Relay Robots. In: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008). ; 2008. doi:10.1007/978-3-642-00644-9_4'
apa: 'Ooi, C. C., & Schindelhauer, C. (2008). Energy-Efficient Distributed Target
Tracking Using Wireless Relay Robots. In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008). https://doi.org/10.1007/978-3-642-00644-9_4'
bibtex: '@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots}, DOI={10.1007/978-3-642-00644-9_4},
booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian},
year={2008} }'
chicago: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” In ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008. https://doi.org/10.1007/978-3-642-00644-9_4.'
ieee: 'C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking
Using Wireless Relay Robots,” in ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
mla: 'Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed
Target Tracking Using Wireless Relay Robots.” ARS’08: Proc. of the 9th International
Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008, doi:10.1007/978-3-642-00644-9_4.'
short: 'C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium
on Distributed Autonomous Robotic Systems (DARS 2008), 2008.'
date_created: 2020-10-01T10:14:06Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/978-3-642-00644-9_4
language:
- iso: eng
publication: 'ARS''08: Proc. of the 9th International Symposium on Distributed Autonomous
Robotic Systems (DARS 2008)'
publication_identifier:
isbn:
- '9783642006432'
- '9783642006449'
publication_status: published
status: public
title: Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19950'
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Lokale Strategien Zur Optimierung von Kommunikationsketten.;
2008.
apa: Pietrzyk, P. (2008). Lokale Strategien zur Optimierung von Kommunikationsketten.
bibtex: '@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten},
author={Pietrzyk, Peter}, year={2008} }'
chicago: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
ieee: P. Pietrzyk, Lokale Strategien zur Optimierung von Kommunikationsketten.
2008.
mla: Pietrzyk, Peter. Lokale Strategien Zur Optimierung von Kommunikationsketten.
2008.
short: P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten,
2008.
date_created: 2020-10-07T14:23:26Z
date_updated: 2022-01-06T06:54:16Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-10-07T14:22:49Z
date_updated: 2020-10-07T14:22:49Z
file_id: '19951'
file_name: pub-hni-3364.pdf
file_size: 638802
relation: main_file
success: 1
file_date_updated: 2020-10-07T14:22:49Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Lokale Strategien zur Optimierung von Kommunikationsketten
type: mastersthesis
user_id: '15415'
year: '2008'
...
---
_id: '20262'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Space-Time Continuous Models of Swarm Robotic Systems.; 2008.
doi:10.1007/978-3-642-13377-0
apa: Hamann, H. (2008). Space-Time Continuous Models of Swarm Robotic Systems.
https://doi.org/10.1007/978-3-642-13377-0
bibtex: '@book{Hamann_2008, title={Space-Time Continuous Models of Swarm Robotic
Systems}, DOI={10.1007/978-3-642-13377-0},
author={Hamann, Heiko}, year={2008} }'
chicago: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems,
2008. https://doi.org/10.1007/978-3-642-13377-0.
ieee: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems. 2008.
mla: Hamann, Heiko. Space-Time Continuous Models of Swarm Robotic Systems.
2008, doi:10.1007/978-3-642-13377-0.
short: H. Hamann, Space-Time Continuous Models of Swarm Robotic Systems, 2008.
date_created: 2020-11-02T14:23:36Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-642-13377-0
language:
- iso: eng
publication_identifier:
isbn:
- '9783642133763'
- '9783642133770'
issn:
- 1867-4925
- 1867-4933
publication_status: published
status: public
title: Space-Time Continuous Models of Swarm Robotic Systems
type: dissertation
user_id: '15415'
year: '2008'
...
---
_id: '26235'
abstract:
- lang: eng
text: "Kolmogorov Complexity constitutes an integral part of computability theory,\r\ninformation
theory, and computational complexity theory -- in the discrete\r\nsetting of bits
and Turing machines. Over real numbers, on the other hand, the\r\nBSS-machine
(aka real-RAM) has been established as a major model of\r\ncomputation. This real
realm has turned out to exhibit natural counterparts to\r\nmany notions and results
in classical complexity and recursion theory; although\r\nusually with considerably
different proofs. The present work investigates\r\nsimilarities and differences
between discrete and real Kolmogorov Complexity as\r\nintroduced by Montana and
Pardo (1998)."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Wouter M.
full_name: Koolen, Wouter M.
last_name: Koolen
citation:
ama: Ziegler M, Koolen WM. Kolmogorov Complexity Theory over the Reals. arXiv:08022027.
Published online 2008.
apa: Ziegler, M., & Koolen, W. M. (2008). Kolmogorov Complexity Theory over
the Reals. In arXiv:0802.2027.
bibtex: '@article{Ziegler_Koolen_2008, title={Kolmogorov Complexity Theory over
the Reals}, journal={arXiv:0802.2027}, author={Ziegler, Martin and Koolen, Wouter
M.}, year={2008} }'
chicago: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over
the Reals.” ArXiv:0802.2027, 2008.
ieee: M. Ziegler and W. M. Koolen, “Kolmogorov Complexity Theory over the Reals,”
arXiv:0802.2027. 2008.
mla: Ziegler, Martin, and Wouter M. Koolen. “Kolmogorov Complexity Theory over the
Reals.” ArXiv:0802.2027, 2008.
short: M. Ziegler, W.M. Koolen, ArXiv:0802.2027 (2008).
date_created: 2021-10-15T09:34:19Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0802.2027
status: public
title: Kolmogorov Complexity Theory over the Reals
type: preprint
user_id: '15415'
year: '2008'
...
---
_id: '26243'
abstract:
- lang: eng
text: "Operations on univariate dense polynomials—multiplication, division with
remainder, multipoint\r\nevaluation—constitute central primitives entering as
build-up blocks into many higher applications and\r\nalgorithms. Fast Fourier
Transform permits to accelerate them from naive quadratic to running time\r\nO(n·polylogn),
that is softly linear in the degree n of the input. This is routinely employed
in complexity\r\ntheoretic considerations and, over integers and finite fields,
in practical number theoretic calculations.\r\nThe present work explores the benefit
of fast polynomial arithmetic over the field of real numbers\r\nwhere the precision
of approximation becomes crucial. To this end, we study the computability of the\r\nabove
operations in the sense of Recursive Analysis as an effective refinement of continuity.
This theo-\r\nretical worst-case stability analysis is then complemented by an
empirical evaluation: We use GMP and\r\nthe iRRAM to find the precision required
for the intermediate calculations in order to achieve a desired\r\noutput accuracy."
author:
- first_name: Sven
full_name: Köhler, Sven
last_name: Köhler
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Köhler S, Ziegler M. On the Stability of Fast Polynomial Arithmetic. In: Proc.
8th Conference on Real Numbers and Computers. ; 2008:147-156.'
apa: Köhler, S., & Ziegler, M. (2008). On the Stability of Fast Polynomial Arithmetic.
Proc. 8th Conference on Real Numbers and Computers, 147–156.
bibtex: '@inproceedings{Köhler_Ziegler_2008, title={On the Stability of Fast Polynomial
Arithmetic}, booktitle={Proc. 8th Conference on Real Numbers and Computers}, author={Köhler,
Sven and Ziegler, Martin}, year={2008}, pages={147–156} }'
chicago: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial
Arithmetic.” In Proc. 8th Conference on Real Numbers and Computers, 147–56,
2008.
ieee: S. Köhler and M. Ziegler, “On the Stability of Fast Polynomial Arithmetic,”
in Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–156.
mla: Köhler, Sven, and Martin Ziegler. “On the Stability of Fast Polynomial Arithmetic.”
Proc. 8th Conference on Real Numbers and Computers, 2008, pp. 147–56.
short: 'S. Köhler, M. Ziegler, in: Proc. 8th Conference on Real Numbers and Computers,
2008, pp. 147–156.'
date_created: 2021-10-15T09:57:36Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
language:
- iso: eng
page: 147-156
publication: Proc. 8th Conference on Real Numbers and Computers
status: public
title: On the Stability of Fast Polynomial Arithmetic
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '26255'
abstract:
- lang: eng
text: "We turn the physical Church-Turing Hypothesis from an ambiguous source of
sensational\r\nspeculations into a (collection of) sound and well-defined scientific
problem(s):\r\nExamining recent controversies and causes for misunderstanding
concerning the state of the Church-\r\nTuring Hypothesis (CTH), it is suggested
to study the CTH ‘sharpened’ relative to an arbitrary but\r\nspecific physical
theory—rather than vaguely referring to “nature” in general. For this purpose
we\r\ncombine physical structuralism with computational complexity theory. The
benefits of this approach\r\nare illustrated by some exemplary results on computability
and complexity in computational physics."
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Physically-Relativized Church-Turing Hypotheses. Applied Mathematics
and Computation. Published online 2008.
apa: Ziegler, M. (2008). Physically-Relativized Church-Turing Hypotheses. Applied
Mathematics and Computation.
bibtex: '@article{Ziegler_2008, title={Physically-Relativized Church-Turing Hypotheses},
journal={Applied Mathematics and Computation}, author={Ziegler, Martin}, year={2008}
}'
chicago: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
ieee: M. Ziegler, “Physically-Relativized Church-Turing Hypotheses,” Applied
Mathematics and Computation, 2008.
mla: Ziegler, Martin. “Physically-Relativized Church-Turing Hypotheses.” Applied
Mathematics and Computation, 2008.
short: M. Ziegler, Applied Mathematics and Computation (2008).
date_created: 2021-10-15T10:10:04Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
external_id:
arxiv:
- '0805.1292'
language:
- iso: eng
publication: Applied Mathematics and Computation
status: public
title: Physically-Relativized Church-Turing Hypotheses
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '26262'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. A Meta-Theory of Physics and Computation. In: Verhandlungen
Der Deutschen Physikalischen Gesellschaft. Deutsche Physikalische Gesellschaft
(DPG); 2008:145.'
apa: Ziegler, M. (2008). A Meta-Theory of Physics and Computation. In Verhandlungen
der Deutschen Physikalischen Gesellschaft (p. 145). Deutsche Physikalische
Gesellschaft (DPG).
bibtex: '@inbook{Ziegler_2008, title={A Meta-Theory of Physics and Computation},
booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Deutsche
Physikalische Gesellschaft (DPG)}, author={Ziegler, Martin}, year={2008}, pages={145}
}'
chicago: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” In Verhandlungen
Der Deutschen Physikalischen Gesellschaft, 145. Deutsche Physikalische Gesellschaft
(DPG), 2008.
ieee: M. Ziegler, “A Meta-Theory of Physics and Computation,” in Verhandlungen
der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
mla: Ziegler, Martin. “A Meta-Theory of Physics and Computation.” Verhandlungen
Der Deutschen Physikalischen Gesellschaft, Deutsche Physikalische Gesellschaft
(DPG), 2008, p. 145.
short: 'M. Ziegler, in: Verhandlungen Der Deutschen Physikalischen Gesellschaft,
Deutsche Physikalische Gesellschaft (DPG), 2008, p. 145.'
date_created: 2021-10-15T10:35:55Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: '145'
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft
publisher: Deutsche Physikalische Gesellschaft (DPG)
status: public
title: A Meta-Theory of Physics and Computation
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '26280'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Meer K, Ziegler M. An explicit solution to Post’s Problem over the reals. Journal
of Complexity. Published online 2008:3-15. doi:10.1016/j.jco.2006.09.004
apa: Meer, K., & Ziegler, M. (2008). An explicit solution to Post’s Problem
over the reals. Journal of Complexity, 3–15. https://doi.org/10.1016/j.jco.2006.09.004
bibtex: '@article{Meer_Ziegler_2008, title={An explicit solution to Post’s Problem
over the reals}, DOI={10.1016/j.jco.2006.09.004},
journal={Journal of Complexity}, author={Meer, Klaus and Ziegler, Martin}, year={2008},
pages={3–15} }'
chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem
over the Reals.” Journal of Complexity, 2008, 3–15. https://doi.org/10.1016/j.jco.2006.09.004.
ieee: 'K. Meer and M. Ziegler, “An explicit solution to Post’s Problem over the
reals,” Journal of Complexity, pp. 3–15, 2008, doi: 10.1016/j.jco.2006.09.004.'
mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over
the Reals.” Journal of Complexity, 2008, pp. 3–15, doi:10.1016/j.jco.2006.09.004.
short: K. Meer, M. Ziegler, Journal of Complexity (2008) 3–15.
date_created: 2021-10-15T12:42:15Z
date_updated: 2022-01-06T06:57:18Z
department:
- _id: '63'
- _id: '26'
doi: 10.1016/j.jco.2006.09.004
language:
- iso: eng
page: 3-15
publication: Journal of Complexity
publication_identifier:
issn:
- 0885-064X
publication_status: published
status: public
title: An explicit solution to Post's Problem over the reals
type: journal_article
user_id: '15415'
year: '2008'
...
---
_id: '17416'
abstract:
- lang: eng
text: "In this paper we present a system for the simultaneous visualization of several
parallel executed simulation replications. By aggregating the scenes of multiple
similar simulations into one single scene it is possible to make a visual statistical
analysis of a set of discrete event simulations as well as to easily compare different
system parameterizations. The aim of our system is to enhance the model analysis,
verification and validation process in terms of speed and ease. The parallel execution
of several simulations of complex models and the visualization of these cannot
be done on one computer, thus a parallel approach is necessary. Our system uses
a thin-client and multiple processors on a PC-cluster. The rendering and the simulation
execution are done on processors of the cluster. The client is used only for the
visualization of the images transmitted by the cluster and for user interaction.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated
Visualization of Multiple Parallel Discrete Event Simulations. In: IEEE International
Symposium on Parallel and Distributed Processing with Applications. ; 2008.
doi:10.1109/ispa.2008.30'
apa: Suess, T., Huber, D., Fischer, M., Laroque, C., & Dangelmaier, W. (2008).
A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.
IEEE International Symposium on Parallel and Distributed Processing with Applications.
https://doi.org/10.1109/ispa.2008.30
bibtex: '@inproceedings{Suess_Huber_Fischer_Laroque_Dangelmaier_2008, title={A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations},
DOI={10.1109/ispa.2008.30},
booktitle={IEEE International Symposium on Parallel and Distributed Processing
with Applications}, author={Suess, Tim and Huber, Daniel and Fischer, Matthias
and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2008} }'
chicago: Suess, Tim, Daniel Huber, Matthias Fischer, Christoph Laroque, and Wilhelm
Dangelmaier. “A System for Aggregated Visualization of Multiple Parallel Discrete
Event Simulations.” In IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008. https://doi.org/10.1109/ispa.2008.30.
ieee: 'T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System
for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,”
2008, doi: 10.1109/ispa.2008.30.'
mla: Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel
Discrete Event Simulations.” IEEE International Symposium on Parallel and Distributed
Processing with Applications, 2008, doi:10.1109/ispa.2008.30.
short: 'T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International
Symposium on Parallel and Distributed Processing with Applications, 2008.'
date_created: 2020-07-27T12:56:15Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/ispa.2008.30
language:
- iso: eng
publication: IEEE International Symposium on Parallel and Distributed Processing with
Applications
publication_identifier:
isbn:
- '9780769534718'
publication_status: published
status: public
title: A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '17868'
abstract:
- lang: eng
text: 'The paper describes an approach for an aggregated animation of a simulation
experiment in an interactive 3D environment, visualizing multiple, distributed
simulation runs. Although the general approach of a 3-dimensional visualization
of material flow simulation helps to understand the dynamic behavior of a system
better as well as faster, it remains unclear, how typical the animated simulation
represents the model, if there is a stochastic influence for even some parameters.
By the integrated visualization of multiple distributed simulation runs, this
uncertainty can be solved, which will be shown in this paper for a typical simulation
study of a queuing system. '
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization
of a distributed simulation experiment of a queuing system. In: 2008 Winter
Simulation Conference. ; 2008:2012-2020. doi:10.1109/wsc.2008.4736296'
apa: Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., & Suess, T. (2008).
Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system. 2008 Winter Simulation Conference, 2012–2020. https://doi.org/10.1109/wsc.2008.4736296
bibtex: '@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami,
FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment
of a queuing system}, DOI={10.1109/wsc.2008.4736296},
booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and
Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008},
pages={2012–2020} }'
chicago: Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque,
and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment
of a Queuing System.” In 2008 Winter Simulation Conference, 2012–20. Miami,
FL., USA, 2008. https://doi.org/10.1109/wsc.2008.4736296.
ieee: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated
3D-visualization of a distributed simulation experiment of a queuing system,”
in 2008 Winter Simulation Conference, 2008, pp. 2012–2020, doi: 10.1109/wsc.2008.4736296.'
mla: Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed
Simulation Experiment of a Queuing System.” 2008 Winter Simulation Conference,
2008, pp. 2012–20, doi:10.1109/wsc.2008.4736296.
short: 'W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter
Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.'
date_created: 2020-08-12T13:39:37Z
date_updated: 2022-01-06T06:53:22Z
department:
- _id: '63'
doi: 10.1109/wsc.2008.4736296
language:
- iso: eng
page: 2012-2020
place: Miami, FL., USA
publication: 2008 Winter Simulation Conference
publication_identifier:
isbn:
- '9781424427079'
publication_status: published
status: public
title: Aggregated 3D-visualization of a distributed simulation experiment of a queuing
system
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19003'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem.
In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT).
; 2008:378-389. doi:10.1007/978-3-540-69903-3_34'
apa: Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm
Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34
bibtex: '@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility
Location Problem}, DOI={10.1007/978-3-540-69903-3_34},
booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)},
author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008},
pages={378–389} }'
chicago: Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic
Facility Location Problem.” In Proceedings of the 11th Scandinavian Workshop
on Algorithm Theory (SWAT), 378–89, 2008. https://doi.org/10.1007/978-3-540-69903-3_34.
ieee: B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location
Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory
(SWAT), 2008, pp. 378–389.
mla: Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89,
doi:10.1007/978-3-540-69903-3_34.
short: 'B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian
Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.'
date_created: 2020-09-04T10:04:49Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69903-3_34
language:
- iso: eng
page: 378-389
publication: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)
publication_identifier:
isbn:
- '9783540699002'
- '9783540699033'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19004'
abstract:
- lang: eng
text: "We present a deterministic kinetic data structure for the facility location
problem that maintains a subset of the moving points as facilities such that,
at any point of time, the sum of the maintenance cost for the facilities and the
connection cost for the clients is at most a constant factor larger than the current
optimal cost. In our scenario, each point can open a facility and moves continuously
along a known trajectory in a d-dimensional Euclidean space where d is a constant.\r\n\r\nOur
kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where
n is the number of points and R is the ratio of the product of the maximum maintenance
cost and demand to the product of their corresponding minimum values. In the case
that each trajectory can be described by a bounded degree polynomial, the data
structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility
changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time
of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first
kinetic data structure for the facility location problem."
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: 'Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem.
In: Proceedings of the 24th European Workshop on Computational Geometry.
; 2008:251-254.'
apa: Gehweiler, J., Lammersen, C., & Degener, B. (2008). The Kinetic Facility
Location Problem. In Proceedings of the 24th European Workshop on Computational
Geometry (pp. 251–254).
bibtex: '@inproceedings{Gehweiler_Lammersen_Degener_2008, title={The Kinetic Facility
Location Problem}, booktitle={Proceedings of the 24th European Workshop on Computational
Geometry}, author={Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian},
year={2008}, pages={251–254} }'
chicago: Gehweiler, Joachim, Christiane Lammersen, and Bastian Degener. “The Kinetic
Facility Location Problem.” In Proceedings of the 24th European Workshop on
Computational Geometry, 251–54, 2008.
ieee: J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location
Problem,” in Proceedings of the 24th European Workshop on Computational Geometry,
2008, pp. 251–254.
mla: Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” Proceedings
of the 24th European Workshop on Computational Geometry, 2008, pp. 251–54.
short: 'J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European
Workshop on Computational Geometry, 2008, pp. 251–254.'
date_created: 2020-09-04T10:11:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
page: 251-254
publication: Proceedings of the 24th European Workshop on Computational Geometry
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...