---
_id: '60388'
abstract:
- lang: eng
text: AbstractIn the field of global surface parametrization
a recent focus has been on so‐called seamless parametrization. This term refers
to parametrization approaches which, while using an atlas of charts to enable
the handling of surfaces of arbitrary topology, relate the parametrization across
the cuts between charts via transition functions from special classes of transformations.
This effectively makes the cuts invisible to applications which are invariant
to these specific transformations in some sense. In actual implementations of
these parametrization approaches, however, these restrictions are obeyed only
approximately; errors stem from the tolerances of numerical solvers employed and,
ultimately, from the limited accuracy of floating point arithmetic. In practice,
robustness issues arise from these flaws in the seamlessness of a parametrization,
no matter how small. We present a robust global algorithm that turns a given approximately
seamless parametrization into an exactly seamless one ‐ that still is representable
by standard floating point numbers. It supports common practically relevant additional
constraints regarding boundary and feature curve alignment or isocurve connectivity,
and ensures that these are likewise fulfilled exactly. This allows subsequent
algorithms to operate robustly on the resulting truly seamless parametrization.
We believe that the core of our method will furthermore be of benefit in a broader
range of applications involving linearly constrained numerical optimization.
author:
- first_name: Manish
full_name: Mandad, Manish
last_name: Mandad
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Mandad M, Campen M. Exact Constraint Satisfaction for Truly Seamless Parametrization.
Computer Graphics Forum. 2019;38(2):135-145. doi:10.1111/cgf.13625
apa: Mandad, M., & Campen, M. (2019). Exact Constraint Satisfaction for Truly
Seamless Parametrization. Computer Graphics Forum, 38(2), 135–145.
https://doi.org/10.1111/cgf.13625
bibtex: '@article{Mandad_Campen_2019, title={Exact Constraint Satisfaction for Truly
Seamless Parametrization}, volume={38}, DOI={10.1111/cgf.13625},
number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Mandad,
Manish and Campen, Marcel}, year={2019}, pages={135–145} }'
chicago: 'Mandad, Manish, and Marcel Campen. “Exact Constraint Satisfaction for
Truly Seamless Parametrization.” Computer Graphics Forum 38, no. 2 (2019):
135–45. https://doi.org/10.1111/cgf.13625.'
ieee: 'M. Mandad and M. Campen, “Exact Constraint Satisfaction for Truly Seamless
Parametrization,” Computer Graphics Forum, vol. 38, no. 2, pp. 135–145,
2019, doi: 10.1111/cgf.13625.'
mla: Mandad, Manish, and Marcel Campen. “Exact Constraint Satisfaction for Truly
Seamless Parametrization.” Computer Graphics Forum, vol. 38, no. 2, Wiley,
2019, pp. 135–45, doi:10.1111/cgf.13625.
short: M. Mandad, M. Campen, Computer Graphics Forum 38 (2019) 135–145.
date_created: 2025-06-26T07:35:31Z
date_updated: 2025-07-14T12:44:26Z
department:
- _id: '969'
doi: 10.1111/cgf.13625
extern: '1'
intvolume: ' 38'
issue: '2'
language:
- iso: eng
page: 135-145
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Exact Constraint Satisfaction for Truly Seamless Parametrization
type: journal_article
user_id: '117512'
volume: 38
year: '2019'
...
---
_id: '60390'
abstract:
- lang: eng
text: "\r\n The problem of discrete surface parametrization,
i.e. mapping a mesh to a planar domain, has been investigated extensively. We
address the more general problem of mapping\r\n between\r\n
\ surfaces. In particular, we provide a formulation that yields a map
between two disk-topology meshes, which is continuous and injective by construction
and which locally minimizes intrinsic distortion. A common approach is to express
such a map as the composition of two maps via a simple intermediate domain such
as the plane, and to independently optimize the individual maps. However, even
if both individual maps are of minimal distortion, there is potentially high distortion
in the composed map. In contrast to many previous works, we minimize distortion
in an end-to-end manner, directly optimizing the quality of the composed map.
This setting poses additional challenges due to the discrete nature of both the
source and the target domain. We propose a formulation that, despite the combinatorial
aspects of the problem, allows for a purely continuous optimization. Further,
our approach addresses the non-smooth nature of discrete distortion measures in
this context which hinders straightforward application of off-the-shelf optimization
techniques. We demonstrate that, despite the challenges inherent to the more involved
setting, discrete surface-to-surface maps can be optimized effectively.\r\n "
author:
- first_name: Patrick
full_name: Schmidt, Patrick
last_name: Schmidt
- first_name: Janis
full_name: Born, Janis
last_name: Born
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Schmidt P, Born J, Campen M, Kobbelt L. Distortion-minimizing injective maps
between surfaces. ACM Transactions on Graphics. 2019;38(6):1-15. doi:10.1145/3355089.3356519
apa: Schmidt, P., Born, J., Campen, M., & Kobbelt, L. (2019). Distortion-minimizing
injective maps between surfaces. ACM Transactions on Graphics, 38(6),
1–15. https://doi.org/10.1145/3355089.3356519
bibtex: '@article{Schmidt_Born_Campen_Kobbelt_2019, title={Distortion-minimizing
injective maps between surfaces}, volume={38}, DOI={10.1145/3355089.3356519},
number={6}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Schmidt, Patrick and Born, Janis and Campen,
Marcel and Kobbelt, Leif}, year={2019}, pages={1–15} }'
chicago: 'Schmidt, Patrick, Janis Born, Marcel Campen, and Leif Kobbelt. “Distortion-Minimizing
Injective Maps between Surfaces.” ACM Transactions on Graphics 38, no.
6 (2019): 1–15. https://doi.org/10.1145/3355089.3356519.'
ieee: 'P. Schmidt, J. Born, M. Campen, and L. Kobbelt, “Distortion-minimizing injective
maps between surfaces,” ACM Transactions on Graphics, vol. 38, no. 6, pp.
1–15, 2019, doi: 10.1145/3355089.3356519.'
mla: Schmidt, Patrick, et al. “Distortion-Minimizing Injective Maps between Surfaces.”
ACM Transactions on Graphics, vol. 38, no. 6, Association for Computing
Machinery (ACM), 2019, pp. 1–15, doi:10.1145/3355089.3356519.
short: P. Schmidt, J. Born, M. Campen, L. Kobbelt, ACM Transactions on Graphics
38 (2019) 1–15.
date_created: 2025-06-26T07:44:21Z
date_updated: 2025-07-14T12:44:37Z
department:
- _id: '969'
doi: 10.1145/3355089.3356519
extern: '1'
intvolume: ' 38'
issue: '6'
language:
- iso: eng
page: 1-15
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Distortion-minimizing injective maps between surfaces
type: journal_article
user_id: '117512'
volume: 38
year: '2019'
...
---
_id: '60389'
abstract:
- lang: eng
text: The generation of quad meshes based on surface parametrization techniques
has proven to be a versatile approach. These techniques quantize an initial seamless
parametrization so as to obtain an integer grid map implying a pure quad mesh.
State-of-the-art methods following this approach have to assume that the surface
to be meshed either has no boundary, or has a boundary which the resulting mesh
is supposed to be aligned to. In a variety of applications this is not desirable
and non-boundary-aligned meshes or grid-parametrizations are preferred. We thus
present a technique to robustly generate integer grid maps which are either boundary-aligned,
non-boundary-aligned, or partially boundary-aligned, just as required by different
applications. We thereby generalize previous work to this broader setting. This
enables the reliable generation of trimmed quad meshes with partial elements along
the boundary, preferable in various scenarios, from tiled texturing over design
and modeling to fabrication and architecture, due to fewer constraints and hence
higher overall mesh quality and other benefits in terms of aesthetics and flexibility.
author:
- first_name: Max
full_name: Lyon, Max
last_name: Lyon
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: David
full_name: Bommes, David
last_name: Bommes
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Lyon M, Campen M, Bommes D, Kobbelt L. Parametrization quantization with free
boundaries for trimmed quad meshing. ACM Transactions on Graphics. 2019;38(4):1-14.
doi:10.1145/3306346.3323019
apa: Lyon, M., Campen, M., Bommes, D., & Kobbelt, L. (2019). Parametrization
quantization with free boundaries for trimmed quad meshing. ACM Transactions
on Graphics, 38(4), 1–14. https://doi.org/10.1145/3306346.3323019
bibtex: '@article{Lyon_Campen_Bommes_Kobbelt_2019, title={Parametrization quantization
with free boundaries for trimmed quad meshing}, volume={38}, DOI={10.1145/3306346.3323019},
number={4}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Lyon, Max and Campen, Marcel and Bommes, David
and Kobbelt, Leif}, year={2019}, pages={1–14} }'
chicago: 'Lyon, Max, Marcel Campen, David Bommes, and Leif Kobbelt. “Parametrization
Quantization with Free Boundaries for Trimmed Quad Meshing.” ACM Transactions
on Graphics 38, no. 4 (2019): 1–14. https://doi.org/10.1145/3306346.3323019.'
ieee: 'M. Lyon, M. Campen, D. Bommes, and L. Kobbelt, “Parametrization quantization
with free boundaries for trimmed quad meshing,” ACM Transactions on Graphics,
vol. 38, no. 4, pp. 1–14, 2019, doi: 10.1145/3306346.3323019.'
mla: Lyon, Max, et al. “Parametrization Quantization with Free Boundaries for Trimmed
Quad Meshing.” ACM Transactions on Graphics, vol. 38, no. 4, Association
for Computing Machinery (ACM), 2019, pp. 1–14, doi:10.1145/3306346.3323019.
short: M. Lyon, M. Campen, D. Bommes, L. Kobbelt, ACM Transactions on Graphics 38
(2019) 1–14.
date_created: 2025-06-26T07:40:49Z
date_updated: 2025-07-14T12:44:32Z
department:
- _id: '969'
doi: 10.1145/3306346.3323019
extern: '1'
intvolume: ' 38'
issue: '4'
language:
- iso: eng
page: 1-14
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Parametrization quantization with free boundaries for trimmed quad meshing
type: journal_article
user_id: '117512'
volume: 38
year: '2019'
...
---
_id: '60384'
abstract:
- lang: eng
text: "Seamless global parametrization of surfaces is a key operation in
geometry processing, e.g., for high-quality quad mesh generation. A common approach
is to prescribe the parametric domain structure, in particular, the locations
of parametrization singularities (cones), and solve a non-convex optimization
problem minimizing a distortion measure, with local injectivity imposed through
either constraints or barrier terms. In both cases, an initial valid parametrization
is essential to serve as a feasible starting point for obtaining an optimized
solution. While convexified versions of the constraints eliminate this initialization
requirement, they narrow the range of solutions, causing some problem instances
that actually do have a solution to become infeasible.\r\n We
demonstrate that for arbitrary given sets of topologically admissible parametric
cones with prescribed curvature, a global seamless parametrization always exists
(with the exception of one well-known case). Importantly, our proof is constructive
and directly leads to a general algorithm for computing such parametrizations.
Most distinctively, this algorithm is bootstrapped with a convex optimization
problem (solving for a conformal map), in tandem with a simple linear equation
system (determining a seamless modification of this map). This initial map can
then serve as a valid starting point and be optimized for low distortion using
existing injectivity preserving methods."
author:
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Hanxiao
full_name: Shen, Hanxiao
last_name: Shen
- first_name: Jiaran
full_name: Zhou, Jiaran
last_name: Zhou
- first_name: Denis
full_name: Zorin, Denis
last_name: Zorin
citation:
ama: Campen M, Shen H, Zhou J, Zorin D. Seamless Parametrization with Arbitrary
Cones for Arbitrary Genus. ACM Transactions on Graphics. 2019;39(1):1-19.
doi:10.1145/3360511
apa: Campen, M., Shen, H., Zhou, J., & Zorin, D. (2019). Seamless Parametrization
with Arbitrary Cones for Arbitrary Genus. ACM Transactions on Graphics,
39(1), 1–19. https://doi.org/10.1145/3360511
bibtex: '@article{Campen_Shen_Zhou_Zorin_2019, title={Seamless Parametrization with
Arbitrary Cones for Arbitrary Genus}, volume={39}, DOI={10.1145/3360511},
number={1}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Campen, Marcel and Shen, Hanxiao and Zhou,
Jiaran and Zorin, Denis}, year={2019}, pages={1–19} }'
chicago: 'Campen, Marcel, Hanxiao Shen, Jiaran Zhou, and Denis Zorin. “Seamless
Parametrization with Arbitrary Cones for Arbitrary Genus.” ACM Transactions
on Graphics 39, no. 1 (2019): 1–19. https://doi.org/10.1145/3360511.'
ieee: 'M. Campen, H. Shen, J. Zhou, and D. Zorin, “Seamless Parametrization with
Arbitrary Cones for Arbitrary Genus,” ACM Transactions on Graphics, vol.
39, no. 1, pp. 1–19, 2019, doi: 10.1145/3360511.'
mla: Campen, Marcel, et al. “Seamless Parametrization with Arbitrary Cones for Arbitrary
Genus.” ACM Transactions on Graphics, vol. 39, no. 1, Association for Computing
Machinery (ACM), 2019, pp. 1–19, doi:10.1145/3360511.
short: M. Campen, H. Shen, J. Zhou, D. Zorin, ACM Transactions on Graphics 39 (2019)
1–19.
date_created: 2025-06-26T07:05:13Z
date_updated: 2025-07-14T12:48:21Z
department:
- _id: '969'
doi: 10.1145/3360511
extern: '1'
intvolume: ' 39'
issue: '1'
language:
- iso: eng
page: 1-19
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Seamless Parametrization with Arbitrary Cones for Arbitrary Genus
type: journal_article
user_id: '117512'
volume: 39
year: '2019'
...
---
_id: '2474'
author:
- first_name: Haitham
full_name: Afifi, Haitham
id: '65718'
last_name: Afifi
- first_name: Sébastien
full_name: Auroux, Sébastien
id: '42575'
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Afifi H, Auroux S, Karl H. MARVELO: Wireless Virtual Network Embedding for
Overlay Graphs with Loops. In: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC); 2018.'
apa: 'Afifi, H., Auroux, S., & Karl, H. (2018). MARVELO: Wireless Virtual Network
Embedding for Overlay Graphs with Loops. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC).'
bibtex: '@inproceedings{Afifi_Auroux_Karl_2018, title={MARVELO: Wireless Virtual
Network Embedding for Overlay Graphs with Loops}, publisher={Proc. of IEEE Wireless
Communications and Networking Conference (WCNC)}, author={Afifi, Haitham and Auroux,
Sébastien and Karl, Holger}, year={2018} }'
chicago: 'Afifi, Haitham, Sébastien Auroux, and Holger Karl. “MARVELO: Wireless
Virtual Network Embedding for Overlay Graphs with Loops.” Proc. of IEEE Wireless
Communications and Networking Conference (WCNC), 2018.'
ieee: 'H. Afifi, S. Auroux, and H. Karl, “MARVELO: Wireless Virtual Network Embedding
for Overlay Graphs with Loops,” 2018.'
mla: 'Afifi, Haitham, et al. MARVELO: Wireless Virtual Network Embedding for
Overlay Graphs with Loops. Proc. of IEEE Wireless Communications and Networking
Conference (WCNC), 2018.'
short: 'H. Afifi, S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018.'
date_created: 2018-04-24T08:06:55Z
date_updated: 2022-01-06T06:56:33Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-24T08:07:24Z
date_updated: 2018-04-24T08:07:24Z
file_id: '2475'
file_name: p2292-afifi.pdf
file_size: 1428258
relation: main_file
success: 1
file_date_updated: 2018-04-24T08:07:24Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '27'
name: 'Akustische Sensornetzwerke - Teilprojekt '
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: 'MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops'
type: conference
user_id: '65718'
year: '2018'
...
---
_id: '2476'
author:
- first_name: Binyam
full_name: Shiferaw Heyi, Binyam
last_name: Shiferaw Heyi
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Shiferaw Heyi B, Karl H. Modelling Time-Limited Capacity of a Wireless Channel
as aMarkov Reward Process. In: Proc. of IEEE Wireless Communications and Networking
Conference (WCNC); 2018.'
apa: Shiferaw Heyi, B., & Karl, H. (2018). Modelling Time-Limited Capacity of
a Wireless Channel as aMarkov Reward Process. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC).
bibtex: '@inproceedings{Shiferaw Heyi_Karl_2018, title={Modelling Time-Limited Capacity
of a Wireless Channel as aMarkov Reward Process}, publisher={Proc. of IEEE Wireless
Communications and Networking Conference (WCNC)}, author={Shiferaw Heyi, Binyam
and Karl, Holger}, year={2018} }'
chicago: Shiferaw Heyi, Binyam, and Holger Karl. “Modelling Time-Limited Capacity
of a Wireless Channel as AMarkov Reward Process.” Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018.
ieee: B. Shiferaw Heyi and H. Karl, “Modelling Time-Limited Capacity of a Wireless
Channel as aMarkov Reward Process,” 2018.
mla: Shiferaw Heyi, Binyam, and Holger Karl. Modelling Time-Limited Capacity
of a Wireless Channel as AMarkov Reward Process. Proc. of IEEE Wireless Communications
and Networking Conference (WCNC), 2018.
short: 'B. Shiferaw Heyi, H. Karl, in: Proc. of IEEE Wireless Communications and
Networking Conference (WCNC), 2018.'
date_created: 2018-04-24T08:09:00Z
date_updated: 2022-01-06T06:56:34Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: tabu
date_created: 2018-04-24T08:08:50Z
date_updated: 2018-04-24T08:08:50Z
file_id: '2477'
file_name: p2861-heyi.pdf
file_size: 428839
relation: main_file
success: 1
file_date_updated: 2018-04-24T08:08:50Z
has_accepted_license: '1'
project:
- _id: '24'
name: Netzgewahre Regelung & regelungsgewahre Netze
publisher: Proc. of IEEE Wireless Communications and Networking Conference (WCNC)
status: public
title: Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process
type: conference
user_id: '15572'
year: '2018'
...
---
_id: '2479'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Amin
full_name: Faez, Amin
last_name: Faez
citation:
ama: 'Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition
of Machine Learning Services. In: SCC. San Francisco, CA, USA: IEEE; 2018.
doi:10.1109/SCC.2018.00039'
apa: 'Mohr, F., Wever, M. D., Hüllermeier, E., & Faez, A. (2018). (WIP) Towards
the Automated Composition of Machine Learning Services. In SCC. San Francisco,
CA, USA: IEEE. https://doi.org/10.1109/SCC.2018.00039'
bibtex: '@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco,
CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services},
DOI={10.1109/SCC.2018.00039},
booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik
and Hüllermeier, Eyke and Faez, Amin}, year={2018} }'
chicago: 'Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP)
Towards the Automated Composition of Machine Learning Services.” In SCC.
San Francisco, CA, USA: IEEE, 2018. https://doi.org/10.1109/SCC.2018.00039.'
ieee: F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated
Composition of Machine Learning Services,” in SCC, San Francisco, CA, USA,
2018.
mla: Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning
Services.” SCC, IEEE, 2018, doi:10.1109/SCC.2018.00039.
short: 'F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco,
CA, USA, 2018.'
conference:
end_date: 2018-07-07
location: San Francisco, CA, USA
name: IEEE International Conference on Services Computing, SCC 2018
start_date: 2018-07-02
date_created: 2018-04-24T08:34:52Z
date_updated: 2022-01-06T06:56:35Z
ddc:
- '000'
department:
- _id: '355'
doi: 10.1109/SCC.2018.00039
file:
- access_level: closed
content_type: application/pdf
creator: wever
date_created: 2018-11-06T15:08:39Z
date_updated: 2018-11-06T15:08:39Z
file_id: '5382'
file_name: 08456425.pdf
file_size: 237890
relation: main_file
file_date_updated: 2018-11-06T15:08:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ieeexplore.ieee.org/document/8456425
oa: '1'
place: San Francisco, CA, USA
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
publication: SCC
publication_status: published
publisher: IEEE
status: public
title: (WIP) Towards the Automated Composition of Machine Learning Services
type: conference
user_id: '49109'
year: '2018'
...
---
_id: '2480'
abstract:
- lang: eng
text: Understanding the behavior of the components of service function chains (SFCs)
in different load situations is important for efficient and automatic management
and orches- tration of services. For this purpose and for practical research in
network function virtualization in general, there is a great need for benchmarks
and experimental data. In this paper, we describe our experiments for characterizing
the relationship between resource demands of virtual network functions (VNFs)
and the expected performance of the SFC, considering the individual performance
of the VNFs as well as the interdependencies among VNFs within the SFC. We have
designed our experiments focusing on video streaming, an important application
in this context. We present examples of models for predicting the interdependence
between resource demands and performance characteristics of SFCs using support
vector regression and polynomial regression models. We also show practical evidence
from our experiments that VNFs need to be benchmarked in their final chain setup,
rather than individually, to capture important interdependencies that affect their
performance. The data gathered from our experiments is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance
Models for Service Function Chains: The Video Streaming Case. In: 4th IEEE
International Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:318--322.
doi:10.1109/NETSOFT.2018.8460029'
apa: 'Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case.
In 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 318--322). Montreal: IEEE. https://doi.org/10.1109/NETSOFT.2018.8460029'
bibtex: '@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource
and Performance Models for Service Function Chains: The Video Streaming Case},
DOI={10.1109/NETSOFT.2018.8460029},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian,
Marvin and Karl, Holger}, year={2018}, pages={318--322} }'
chicago: 'Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating
Resource and Performance Models for Service Function Chains: The Video Streaming
Case.” In 4th IEEE International Conference on Network Softwarization (NetSoft
2018), 318--322. IEEE, 2018. https://doi.org/10.1109/NETSOFT.2018.8460029.'
ieee: 'S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and
Performance Models for Service Function Chains: The Video Streaming Case,” in
4th IEEE International Conference on Network Softwarization (NetSoft 2018),
Montreal, 2018, pp. 318--322.'
mla: 'Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service
Function Chains: The Video Streaming Case.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322, doi:10.1109/NETSOFT.2018.8460029.'
short: 'S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322.'
conference:
end_date: 2018-07-29
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
start_date: 2018-07-25
date_created: 2018-04-24T12:11:36Z
date_updated: 2022-01-06T06:56:37Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2018.8460029
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-12-12T15:18:12Z
date_updated: 2018-12-12T15:18:12Z
file_id: '6195'
file_name: 08460029.pdf
file_size: 2211450
relation: main_file
success: 1
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2019-01-24T10:17:00Z
date_updated: 2019-01-24T10:17:00Z
file_id: '6968'
file_name: NetSoft18_RIS.pdf
file_size: 3445650
relation: main_file
file_date_updated: 2019-01-24T10:17:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 318--322
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publisher: IEEE
status: public
title: 'Generating Resource and Performance Models for Service Function Chains: The
Video Streaming Case'
type: conference
user_id: '31764'
year: '2018'
...
---
_id: '2481'
abstract:
- lang: eng
text: Network function virtualization requires scaling and placement, deciding the
number and the location of function instances. Current approaches are limited
in flexibility and practical applicability. Specifically, we study dynamic, single-step,
joint scaling and placement of network services with bidirectional flows traversing
Physical or Virtual Network Functions (VNFs) and returning to their sources. We
develop models to support stateful components and legacy network functions with
fixed locations in these network services as well as the possibility of reusing
VNFs across network services. We formalize the problem of jointly scaling and
placing such network services as a mixed- integer linear program (MILP). We show
that this problem is NP-complete and also present a heuristic algorithm to find
good solutions in short time. In an extensive evaluation with realistic scenarios,
we investigate the capabilities of the two approaches.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Schneider SB, Karl H. Scaling and Placing Bidirectional Services
with Stateful Virtual and Physical Network Functions. In: 4th IEEE International
Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:123--131.'
apa: 'Dräxler, S., Schneider, S. B., & Karl, H. (2018). Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions. In
4th IEEE International Conference on Network Softwarization (NetSoft 2018)
(pp. 123--131). Montreal: IEEE.'
bibtex: '@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing
Bidirectional Services with Stateful Virtual and Physical Network Functions},
booktitle={4th IEEE International Conference on Network Softwarization (NetSoft
2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar
and Karl, Holger}, year={2018}, pages={123--131} }'
chicago: Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling
and Placing Bidirectional Services with Stateful Virtual and Physical Network
Functions.” In 4th IEEE International Conference on Network Softwarization
(NetSoft 2018), 123--131. IEEE, 2018.
ieee: S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional
Services with Stateful Virtual and Physical Network Functions,” in 4th IEEE
International Conference on Network Softwarization (NetSoft 2018), Montreal,
2018, pp. 123--131.
mla: Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful
Virtual and Physical Network Functions.” 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.
short: 'S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference
on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.'
conference:
location: Montreal
name: 4th IEEE International Conference on Network Softwarization (NetSoft 2018)
date_created: 2018-04-24T12:14:00Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T07:40:57Z
date_updated: 2018-06-25T07:40:57Z
file_id: '3319'
file_name: RIS.pdf
file_size: 1471937
relation: main_file
file_date_updated: 2018-06-25T07:40:57Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 123--131
project:
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 4th IEEE International Conference on Network Softwarization (NetSoft
2018)
publication_status: published
publisher: IEEE
status: public
title: ' Scaling and Placing Bidirectional Services with Stateful Virtual and Physical
Network Functions'
type: conference
urn: '24814'
user_id: '477'
year: '2018'
...
---
_id: '2483'
abstract:
- lang: eng
text: Understanding the behavior of distributed cloud service components in different
load situations is important for efficient and automatic management and orchestration
of these services. For this purpose and for practical research in distributed
cloud computing in general, there is need for benchmarks and experimental data.
In this paper, we describe our experiments for characterizing the relationship
between resource demands of application components and the expected performance
of applica- tions. We present initial results for predicting the interdependence
between resource demands and performance characteristics using support vector
regression and polynomial regression models. The data gathered from our experiments
is publicly available.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Marvin
full_name: Illian, Marvin
last_name: Illian
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler S, Peuster M, Illian M, Karl H. Towards Predicting Resource Demands
and Performance of Distributed Cloud Services. Wien, Darmstadt; 2018.
apa: Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Towards Predicting
Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt.
bibtex: '@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch
Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance
of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and
Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog
Computing 2018} }'
chicago: Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. Towards
Predicting Resource Demands and Performance of Distributed Cloud Services.
KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.
ieee: S. Dräxler, M. Peuster, M. Illian, and H. Karl, Towards Predicting Resource
Demands and Performance of Distributed Cloud Services. Wien, Darmstadt, 2018.
mla: Dräxler, Sevil, et al. Towards Predicting Resource Demands and Performance
of Distributed Cloud Services. 2018.
short: S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands
and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018.
date_created: 2018-04-24T12:22:40Z
date_updated: 2022-01-06T06:56:38Z
ddc:
- '000'
department:
- _id: '75'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14
oa: '1'
place: Wien, Darmstadt
project:
- _id: '23'
grant_number: '762057'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication_status: published
related_material:
link:
- relation: confirmation
url: http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843
series_title: KuVS-Fachgespräch Fog Computing 2018
status: public
title: Towards Predicting Resource Demands and Performance of Distributed Cloud Services
type: report
user_id: '31764'
year: '2018'
...
---
_id: '2484'
abstract:
- lang: eng
text: We study the classic bin packing problem in a fully-dynamic setting, where
new items can arrive and old items may depart. We want algorithms with low asymptotic
competitive ratio while repacking items sparingly between updates. Formally, each
item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
This is motivated by cloud storage applications, where fully-dynamic bin packing
models the problem of data backup to minimize the number of disks used, as well
as communication incurred in moving file backups between disks. Since the set
of files changes over time, we could recompute a solution periodically from scratch,
but this would give a high number of disk rewrites, incurring a high energy cost
and possible wear and tear of the disks. In this work, we present optimal tradeoffs
between number of bins used and number of items repacked, as well as natural extensions
of the latter measure.
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Anupam
full_name: Gupta, Anupam
last_name: Gupta
- first_name: Guru
full_name: Guruganesh, Guru
last_name: Guruganesh
- first_name: 'Amit '
full_name: 'Kumar, Amit '
last_name: Kumar
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: David
full_name: Wajc, David
last_name: Wajc
citation:
ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018).
Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51'
apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018)
(Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51'
bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
(LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
DOI={10.4230/LIPIcs.ICALP.2018.51},
booktitle={45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
in Informatics (LIPIcs)} }'
chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar,
Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
In 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.'
ieee: B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,”
in 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), Prag, 2018, vol. 107, pp. 51:1-51:24.
mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
45th International Colloquium on Automata, Languages, and Programming (ICALP
2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.
short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
International Colloquium on Automata, Languages, and Programming (ICALP 2018),
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
51:1-51:24.'
conference:
end_date: 2018-07-13
location: Prag
name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
2018)
start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
full_name: Chatzigiannakis, Ioannis
last_name: Chatzigiannakis
- first_name: Christos
full_name: Kaklamanis, Christos
last_name: Kaklamanis
- first_name: Dániel
full_name: Marx, Dániel
last_name: Marx
- first_name: Donald
full_name: Sannella, Donald
last_name: Sannella
external_id:
arxiv:
- '1711.01231'
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:18Z
date_updated: 2018-10-31T16:58:18Z
file_id: '5227'
file_name: LIPIcs-ICALP-2018-51.pdf
file_size: 723824
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: ' 107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '16'
name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
(ICALP 2018)
publication_identifier:
isbn:
- 978-3-95977-076-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2485'
author:
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities.
In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389'
apa: 'Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location
with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389'
bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
Location with Mobile Facilities}, DOI={10.1145/3210377.3210389},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.
ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), Wien, 2018, pp. 373–381.
mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.
short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
location: Wien
name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:42:33Z
date_updated: 2018-11-02T14:42:33Z
file_id: '5280'
file_name: p373-feldkord.pdf
file_size: 1207546
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '25121'
abstract:
- lang: eng
text: We consider a group of $n$ autonomous mobile robots of which $m$ are stationary
thus cannot move. Robots are represented by points in the Euclidean plane. They
have no memory, do not communicate or share a common coordinate system and they
move solely based on the positioning of other robots within their limited viewing
range of 1. The goal is to gather the robots inside of the convex hull of all
stationary robots. A variant of this problem, the general gathering problem, has
been studied in various different time models. In this work, we consider a continuous
time model, where robots continuously observe their neighbors, compute the next
target of movement and move with a speed limit of 1 at any time. Regarding the
robots' local strategy, we only study contracting algorithms in which every robot
that is positioned on the border of the convex hull of all robots moves into this
hull. We present a time bound of $\mathcal{O}(nd)$ for any general contracting
algorithms in a configuration with only a single stationary robot. For configurations
with more stationary robots, we prove that robots converge against the convex
hull of all stationary robots and that no upper bound on the runtime exists. For
the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle,
we provide linear time bounds.
author:
- first_name: David Jan
full_name: Liedtke, David Jan
id: '55557'
last_name: Liedtke
citation:
ama: Liedtke DJ. Influence of Stationary Robots on Continuous Robot Formation
Problems.; 2018.
apa: Liedtke, D. J. (2018). Influence of Stationary Robots on Continuous Robot
Formation Problems.
bibtex: '@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous
Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }'
chicago: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot
Formation Problems, 2018.
ieee: D. J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation
Problems. 2018.
mla: Liedtke, David Jan. Influence of Stationary Robots on Continuous Robot Formation
Problems. 2018.
short: D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation
Problems, 2018.
date_created: 2021-09-29T12:30:40Z
date_updated: 2022-01-06T06:56:52Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: local
content_type: application/pdf
creator: liedtke
date_created: 2021-09-29T12:21:24Z
date_updated: 2021-09-29T12:21:24Z
file_id: '25124'
file_name: Bachelor - Thesis.pdf
file_size: 6746519
relation: main_file
file_date_updated: 2021-09-29T12:21:24Z
has_accepted_license: '1'
language:
- iso: eng
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Influence of Stationary Robots on Continuous Robot Formation Problems
type: bachelorsthesis
user_id: '55557'
year: '2018'
...
---
_id: '19524'
abstract:
- lang: eng
text: "Object ranking is an important problem in the realm of preference learning.\r\nOn
the basis of training data in the form of a set of rankings of objects,\r\nwhich
are typically represented as feature vectors, the goal is to learn a\r\nranking
function that predicts a linear order of any new set of objects.\r\nCurrent approaches
commonly focus on ranking by scoring, i.e., on learning an\r\nunderlying latent
utility function that seeks to capture the inherent utility\r\nof each object.
These approaches, however, are not able to take possible\r\neffects of context-dependence
into account, where context-dependence means that\r\nthe utility or usefulness
of an object may also depend on what other objects\r\nare available as alternatives.
In this paper, we formalize the problem of\r\ncontext-dependent ranking and present
two general approaches based on two\r\nnatural representations of context-dependent
ranking functions. Both approaches\r\nare instantiated by means of appropriate
neural network architectures, which\r\nare evaluated on suitable benchmark task."
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
- first_name: Pritha
full_name: Gupta, Pritha
last_name: Gupta
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: Pfannschmidt K, Gupta P, Hüllermeier E. Deep Architectures for Learning Context-dependent
Ranking Functions. arXiv:180305796. 2018.
apa: Pfannschmidt, K., Gupta, P., & Hüllermeier, E. (2018). Deep Architectures
for Learning Context-dependent Ranking Functions. ArXiv:1803.05796.
bibtex: '@article{Pfannschmidt_Gupta_Hüllermeier_2018, title={Deep Architectures
for Learning Context-dependent Ranking Functions}, journal={arXiv:1803.05796},
author={Pfannschmidt, Karlson and Gupta, Pritha and Hüllermeier, Eyke}, year={2018}
}'
chicago: Pfannschmidt, Karlson, Pritha Gupta, and Eyke Hüllermeier. “Deep Architectures
for Learning Context-Dependent Ranking Functions.” ArXiv:1803.05796, 2018.
ieee: K. Pfannschmidt, P. Gupta, and E. Hüllermeier, “Deep Architectures for Learning
Context-dependent Ranking Functions,” arXiv:1803.05796. 2018.
mla: Pfannschmidt, Karlson, et al. “Deep Architectures for Learning Context-Dependent
Ranking Functions.” ArXiv:1803.05796, 2018.
short: K. Pfannschmidt, P. Gupta, E. Hüllermeier, ArXiv:1803.05796 (2018).
date_created: 2020-09-17T10:53:39Z
date_updated: 2022-01-06T06:54:06Z
department:
- _id: '7'
- _id: '355'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: arXiv:1803.05796
status: public
title: Deep Architectures for Learning Context-dependent Ranking Functions
type: preprint
user_id: '13472'
year: '2018'
...
---
_id: '19978'
abstract:
- lang: eng
text: "We introduce the \\emph{Online Connected Dominating Set Leasing} problem\r\n(OCDSL)
in which we are given an undirected connected graph $G = (V, E)$, a set\r\n$\\mathcal{L}$
of lease types each characterized by a duration and cost, and a\r\nsequence of
subsets of $V$ arriving over time. A node can be leased using lease\r\ntype $l$
for cost $c_l$ and remains active for time $d_l$. The adversary gives\r\nin each
step $t$ a subset of nodes that need to be dominated by a connected\r\nsubgraph
consisting of nodes active at time $t$. The goal is to minimize the\r\ntotal leasing
costs. OCDSL contains the \\emph{Parking Permit\r\nProblem}~\\cite{PPP} as a special
subcase and generalizes the classical offline\r\n\\emph{Connected Dominating Set}
problem~\\cite{Guha1998}. It has an $\\Omega(\\log\r\n^2 n + \\log |\\mathcal{L}|)$
randomized lower bound resulting from lower bounds\r\nfor the \\emph{Parking Permit
Problem} and the \\emph{Online Set Cover}\r\nproblem~\\cite{Alon:2003:OSC:780542.780558,Korman},
where $|\\mathcal{L}|$ is the\r\nnumber of available lease types and $n$ is the
number of nodes in the input\r\ngraph. We give a randomized $\\mathcal{O}(\\log
^2 n + \\log |\\mathcal{L}| \\log\r\nn)$-competitive algorithm for OCDSL. We also
give a deterministic algorithm for\r\na variant of OCDSL in which the dominating
subgraph need not be connected, the\r\n\\emph{Online Dominating Set Leasing} problem.
The latter is based on a simple\r\nprimal-dual approach and has an $\\mathcal{O}(|\\mathcal{L}|
\\cdot\r\n\\Delta)$-competitive ratio, where $\\Delta$ is the maximum degree of
the input\r\ngraph."
author:
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
citation:
ama: Markarian C. Online Connected Dominating Set Leasing. arXiv:180502994.
2018.
apa: Markarian, C. (2018). Online Connected Dominating Set Leasing. ArXiv:1805.02994.
bibtex: '@article{Markarian_2018, title={Online Connected Dominating Set Leasing},
journal={arXiv:1805.02994}, author={Markarian, Christine}, year={2018} }'
chicago: Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994,
2018.
ieee: C. Markarian, “Online Connected Dominating Set Leasing,” arXiv:1805.02994.
2018.
mla: Markarian, Christine. “Online Connected Dominating Set Leasing.” ArXiv:1805.02994,
2018.
short: C. Markarian, ArXiv:1805.02994 (2018).
date_created: 2020-10-12T12:42:54Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:1805.02994
status: public
title: Online Connected Dominating Set Leasing
type: preprint
user_id: '15415'
year: '2018'
...
---
_id: '20'
abstract:
- lang: eng
text: "Approximate computing has shown to provide new ways to improve performance\r\nand
power consumption of error-resilient applications. While many of these\r\napplications
can be found in image processing, data classification or machine\r\nlearning,
we demonstrate its suitability to a problem from scientific\r\ncomputing. Utilizing
the self-correcting behavior of iterative algorithms, we\r\nshow that approximate
computing can be applied to the calculation of inverse\r\nmatrix p-th roots which
are required in many applications in scientific\r\ncomputing. Results show great
opportunities to reduce the computational effort\r\nand bandwidth required for
the execution of the discussed algorithm, especially\r\nwhen targeting special
accelerator hardware."
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation
of Inverse Matrix p-th Roots. Embedded Systems Letters. 2018;10(2):33-36.
doi:10.1109/LES.2017.2760923
apa: Lass, M., Kühne, T., & Plessl, C. (2018). Using Approximate Computing for
the Calculation of Inverse Matrix p-th Roots. Embedded Systems Letters,
10(2), 33–36. https://doi.org/10.1109/LES.2017.2760923
bibtex: '@article{Lass_Kühne_Plessl_2018, title={Using Approximate Computing for
the Calculation of Inverse Matrix p-th Roots}, volume={10}, DOI={10.1109/LES.2017.2760923},
number={2}, journal={Embedded Systems Letters}, publisher={IEEE}, author={Lass,
Michael and Kühne, Thomas and Plessl, Christian}, year={2018}, pages={33–36} }'
chicago: 'Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate
Computing for the Calculation of Inverse Matrix P-Th Roots.” Embedded Systems
Letters 10, no. 2 (2018): 33–36. https://doi.org/10.1109/LES.2017.2760923.'
ieee: M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing for the Calculation
of Inverse Matrix p-th Roots,” Embedded Systems Letters, vol. 10, no. 2,
pp. 33–36, 2018.
mla: Lass, Michael, et al. “Using Approximate Computing for the Calculation of Inverse
Matrix P-Th Roots.” Embedded Systems Letters, vol. 10, no. 2, IEEE, 2018,
pp. 33–36, doi:10.1109/LES.2017.2760923.
short: M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.
date_created: 2017-07-25T14:41:08Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '27'
- _id: '518'
- _id: '304'
doi: 10.1109/LES.2017.2760923
external_id:
arxiv:
- '1703.02283'
intvolume: ' 10'
issue: '2'
language:
- iso: eng
page: ' 33-36'
project:
- _id: '32'
grant_number: PL 595/2-1
name: Performance and Efficiency in HPC with Custom Computing
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Embedded Systems Letters
publication_identifier:
eissn:
- 1943-0671
issn:
- 1943-0663
publication_status: published
publisher: IEEE
status: public
title: Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots
type: journal_article
user_id: '16153'
volume: 10
year: '2018'
...
---
_id: '20188'
author:
- first_name: Ivan
full_name: Habernal, Ivan
last_name: Habernal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Habernal I, Wachsmuth H, Gurevych I, Stein B. The Argument Reasoning Comprehension
Task: Identification and Reconstruction of Implicit Warrants. In: Proceedings
of the 16th Annual Conference of the North American Chapter of the Association
for Computational Linguistics: Human Language Technologies. ; 2018:1930–1940.'
apa: 'Habernal, I., Wachsmuth, H., Gurevych, I., & Stein, B. (2018). The Argument
Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants.
In Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies
(pp. 1930–1940).'
bibtex: '@inproceedings{Habernal_Wachsmuth_Gurevych_Stein_2018, title={The Argument
Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants},
booktitle={Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies},
author={Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno},
year={2018}, pages={1930–1940} }'
chicago: 'Habernal, Ivan, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. “The
Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit
Warrants.” In Proceedings of the 16th Annual Conference of the North American
Chapter of the Association for Computational Linguistics: Human Language Technologies,
1930–1940, 2018.'
ieee: 'I. Habernal, H. Wachsmuth, I. Gurevych, and B. Stein, “The Argument Reasoning
Comprehension Task: Identification and Reconstruction of Implicit Warrants,” in
Proceedings of the 16th Annual Conference of the North American Chapter of
the Association for Computational Linguistics: Human Language Technologies,
2018, pp. 1930–1940.'
mla: 'Habernal, Ivan, et al. “The Argument Reasoning Comprehension Task: Identification
and Reconstruction of Implicit Warrants.” Proceedings of the 16th Annual Conference
of the North American Chapter of the Association for Computational Linguistics:
Human Language Technologies, 2018, pp. 1930–1940.'
short: 'I. Habernal, H. Wachsmuth, I. Gurevych, B. Stein, in: Proceedings of the
16th Annual Conference of the North American Chapter of the Association for Computational
Linguistics: Human Language Technologies, 2018, pp. 1930–1940.'
date_created: 2020-10-23T16:46:30Z
date_updated: 2022-01-06T06:54:21Z
department:
- _id: '600'
language:
- iso: eng
page: 1930–1940
publication: 'Proceedings of the 16th Annual Conference of the North American Chapter
of the Association for Computational Linguistics: Human Language Technologies'
status: public
title: 'The Argument Reasoning Comprehension Task: Identification and Reconstruction
of Implicit Warrants'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '2831'
abstract:
- lang: eng
text: 'We consider a market where final products or services are compositions of
a number of basic services. Users are asked to evaluate the quality of the composed
product after purchase. The quality of the basic service influences the performance
of the composed services but cannot be observed directly. The question we pose
is whether it is possible to use user evaluations on composed services to assess
the quality of basic services. We discuss how to combine aggregation of evaluations
across users and disaggregation of information on composed services to derive
valuations for the single components. As a solution we propose to use the (weighted)
average as aggregation device in connection with the Shapley value as disaggregation
method, since this combination fulfills natural requirements in our context. In
addition, we address some occurring computational issues: We give an approximate
solution concept using only a limited number of evaluations which guarantees nearly
optimal results with reduced running time. Lastly, we show that a slightly modified
Shapley value and the weighted average are still applicable if the evaluation
profiles are incomplete.'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
- first_name: Nadja
full_name: Stroh-Maraun, Nadja
id: '13264'
last_name: Stroh-Maraun
citation:
ama: 'Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations
Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics
of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659'
apa: Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating
User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6).
Irvine, California, USA. https://doi.org/10.1145/3230654.3230659
bibtex: '@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating
User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659},
booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen
and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6}
}'
chicago: Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun.
“Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of
the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018),
5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
ieee: M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating
User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop
on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine,
California, USA, 2018, pp. 5:1-5:6.
mla: Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley
Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems
and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
short: 'M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings
of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon
2018), 2018, pp. 5:1-5:6.'
conference:
end_date: 2018-06-18
location: Irvine, California, USA
name: The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon
2018)
start_date: 2018-06-18
date_created: 2018-05-22T10:28:51Z
date_updated: 2022-01-06T06:58:01Z
ddc:
- '040'
department:
- _id: '541'
- _id: '63'
- _id: '205'
- _id: '475'
doi: 10.1145/3230654.3230659
file:
- access_level: closed
content_type: application/pdf
creator: nmaraun
date_created: 2018-08-15T07:30:50Z
date_updated: 2018-08-15T07:30:50Z
file_id: '3910'
file_name: Disaggregating User Evaluations Using the Shapley Value.pdf
file_size: 1450171
relation: main_file
success: 1
file_date_updated: 2018-08-15T07:30:50Z
has_accepted_license: '1'
language:
- iso: eng
page: 5:1-5:6
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Proceedings of the 13th Workshop on Economics of Networks, Systems and
Computation (NetEcon 2018)
publication_identifier:
isbn:
- 978-1-4503-5916-0
publication_status: published
status: public
title: Disaggregating User Evaluations Using the Shapley Value
type: conference
user_id: '14052'
year: '2018'
...
---
_id: '2848'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y
apa: Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible
Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574.
https://doi.org/10.1007/s00453-018-0420-y
bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y},
number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
}'
chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5
(2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.'
ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574,
2018.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.
short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:18:16Z
date_updated: 2018-11-02T15:18:16Z
file_id: '5298'
file_name: TowardsFlexibleDemandsInOnline.pdf
file_size: 600583
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
DOI={10.1007/s00224-017-9836-z},
journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2018} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
Theory of Computing Systems, 2018.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems,
Springer, 2018, doi:10.1007/s00224-017-9836-z.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:24:32Z
date_updated: 2018-11-02T15:24:32Z
file_id: '5301'
file_name: ApproximationAndHeuristicAlgor.pdf
file_size: 1371624
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:24:32Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Theory of Computing Systems
publication_identifier:
unknown:
- 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...