@inbook{17058,
author = {Tönnies, Merle and Göhrmann, Matthias},
booktitle = {How to Do Cultural Studies: Ideas, Approaches, Scenarios},
editor = {Kramer, Jürgen and Lenz, Bernd},
pages = {303--339},
publisher = {Königshausen & Neumann},
title = {{British Political Rhetoric from World War II to Brexit: A Cultural Studies Approach}},
year = {2020},
}
@article{17072,
author = {Feng, Yuanhua and Gries, Thomas and Fritz, Marlon},
issn = {1048-5252},
journal = {Journal of Nonparametric Statistics},
pages = {510--533},
title = {{Data-driven local polynomial for the trend and its derivatives in economic time series}},
doi = {10.1080/10485252.2020.1759598},
year = {2020},
}
@inproceedings{17089,
author = {Dreiling, Dmitrij and Itner, Dominik Thor and Feldmann, Nadine and Gravenkamp, Hauke and Henning, Bernd},
location = {Nürnberg},
publisher = {AMA Service GmbH},
title = {{Increasing the sensitivity in the determination of material parameters by using arbitrary loads in ultrasonic transmission measurements}},
doi = {10.5162/SMSI2020/D1.3},
year = {2020},
}
@inproceedings{17084,
author = {Weidmann, Nils and Anjorin, Anthony},
booktitle = {Fundamental Approaches to Software Engineering},
isbn = {9783030452339},
issn = {0302-9743},
title = {{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}},
doi = {10.1007/978-3-030-45234-6_16},
year = {2020},
}
@inproceedings{17159,
author = {Wolf, Verena and Franke, Alena and Bartelheimer, Christian},
booktitle = {Proceedings of the 15th International Conference on Wirtschaftsinformatik / 15. Internationale Tagung Wirtschaftsinformatik},
location = {Potsdam, Germany},
title = {{Establishing Smart Service Systems is a Challenge: A Case Study on Pitfalls and Implications}},
year = {2020},
}
@inproceedings{16790,
author = {Krings, Sarah Claudia and Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor},
booktitle = {Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)},
isbn = {978-1-4503-7984-7/20/06},
title = {{Development Framework for Context-Aware Augmented Reality Applications}},
doi = {10.1145/3393672.3398640},
year = {2020},
}
@inbook{17337,
author = {Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor},
booktitle = {Advanced Information Systems Engineering},
isbn = {9783030494346},
issn = {0302-9743},
title = {{Modeling and Analyzing Architectural Diversity of Open Platforms}},
doi = {10.1007/978-3-030-49435-3_3},
year = {2020},
}
@inproceedings{17349,
author = {Grabo, Matti and Staggenborg, Christoph and Kenig, Eugeny},
location = {Frankfurt am Main},
title = {{Modellierung und Optimierung makroverkapselter Latentwärmespeicherelemente für ein luftgeführtes Wärmespeichersystem}},
year = {2020},
}
@article{17363,
author = {Hoffmann, Christin and Thommes, Kirsten},
journal = {Economics Letters},
number = {108984},
title = {{Using loss aversion to incentivize energy efficiency in a principal agent context - Evidence from a field experiment}},
volume = {189},
year = {2020},
}
@inproceedings{17370,
abstract = { 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.},
author = {Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures},
isbn = {9781450369350},
keyword = {Online Multi-Commodity Facility Location, Competitive Ratio, Online Optimization, Facility Location Problem},
title = {{The Online Multi-Commodity Facility Location Problem}},
doi = {10.1145/3350755.3400281},
year = {2020},
}