TY - CHAP
AU - Tönnies, Merle
AU - Göhrmann, Matthias
ED - Kramer, Jürgen
ED - Lenz, Bernd
ID - 17058
T2 - How to Do Cultural Studies: Ideas, Approaches, Scenarios
TI - British Political Rhetoric from World War II to Brexit: A Cultural Studies Approach
ER -
TY - JOUR
AU - Feng, Yuanhua
AU - Gries, Thomas
AU - Fritz, Marlon
ID - 17072
JF - Journal of Nonparametric Statistics
SN - 1048-5252
TI - Data-driven local polynomial for the trend and its derivatives in economic time series
ER -
TY - CONF
AU - Dreiling, Dmitrij
AU - Itner, Dominik Thor
AU - Feldmann, Nadine
AU - Gravenkamp, Hauke
AU - Henning, Bernd
ID - 17089
TI - Increasing the sensitivity in the determination of material parameters by using arbitrary loads in ultrasonic transmission measurements
ER -
TY - CONF
AU - Weidmann, Nils
AU - Anjorin, Anthony
ID - 17084
SN - 0302-9743
T2 - Fundamental Approaches to Software Engineering
TI - Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming
ER -
TY - CONF
AU - Wolf, Verena
AU - Franke, Alena
AU - Bartelheimer, Christian
ID - 17159
T2 - Proceedings of the 15th International Conference on Wirtschaftsinformatik / 15. Internationale Tagung Wirtschaftsinformatik
TI - Establishing Smart Service Systems is a Challenge: A Case Study on Pitfalls and Implications
ER -
TY - CONF
AU - Krings, Sarah Claudia
AU - Yigitbas, Enes
AU - Jovanovikj, Ivan
AU - Sauer, Stefan
AU - Engels, Gregor
ID - 16790
SN - 978-1-4503-7984-7/20/06
T2 - Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)
TI - Development Framework for Context-Aware Augmented Reality Applications
ER -
TY - CHAP
AU - Jazayeri, Bahar
AU - Schwichtenberg, Simon
AU - Küster, Jochen
AU - Zimmermann, Olaf
AU - Engels, Gregor
ID - 17337
SN - 0302-9743
T2 - Advanced Information Systems Engineering
TI - Modeling and Analyzing Architectural Diversity of Open Platforms
ER -
TY - GEN
AU - Grabo, Matti
AU - Staggenborg, Christoph
AU - Kenig, Eugeny
ID - 17349
TI - Modellierung und Optimierung makroverkapselter Latentwärmespeicherelemente für ein luftgeführtes Wärmespeichersystem
ER -
TY - JOUR
AU - Hoffmann, Christin
AU - Thommes, Kirsten
ID - 17363
IS - 108984
JF - Economics Letters
TI - Using loss aversion to incentivize energy efficiency in a principal agent context - Evidence from a field experiment
VL - 189
ER -
TY - CONF
AB - We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \( S \) of commodities.
Ravi and Sinha (SODA 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.
The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.
In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.
A request has to be connected to a set of facilities jointly offering the commodities demanded by it.
In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.
To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.
We present results regarding the competitive ratio.
On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega ( \sqrt{|S|} + \frac{\log n}{\log \log n} ) \) that already holds for simple line metrics.
Here, \( n \) is the number of requests.
On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm.
Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.
AU - Castenow, Jannik
AU - Feldkord, Björn
AU - Knollmann, Till
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 17370
KW - Online Multi-Commodity Facility Location
KW - Competitive Ratio
KW - Online Optimization
KW - Facility Location Problem
SN - 9781450369350
T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
TI - The Online Multi-Commodity Facility Location Problem
ER -