CRC 901 - Capabilities and limitations of local strategies in dynamic networks (Subproject A1)
Overview
We are engaged in Project A1 with local strategies to address fundamental challenges for the organization of large, dynamic markets. Our studies encompass the design, analysis, and evaluation of local algorithms. Important issues are the complex distributed search for services, the dynamic adaptation of networks to applications and user behavior, the study of the impact of external dynamics, as well as the continued development of the OTF market infrastructure.
Key Facts
- Project duration:
- 07/2011 - 06/2023
- Funded by:
- DFG
More Information
Publications
Beep-and-Sleep: Message and Energy Efficient Set Cover
T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.
Routing Schemes for Hybrid Communication Networks
J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.
Time-Optimal Construction of Overlays
Show all publications
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).