Konferenzen  >  Informatik  >  Algorithmen und Datenstrukturen  >  Deutschland

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Fair division concerns the allocation of resources to a set of interested entities, according to some fairness criteria. Fair division has remained an active research area over the years, attracting the attention of several scientific disciplines, such as mathematics, computer science, game theory, and political science. Especially within the last two decades, this area has gradually drawn significantly more attention, due to the emergence of novel solution concepts, algorithmic techniques, and promising applications. It has also gained increasing popularity within computer science, since many of the field's key questions are inherently algorithmic. Consequently, there has been a notable growth of the relevant literature by now, spanning numerous fascinating research directions.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

A long-standing question in theoretical computer science is to offer analysis tools for improving performance on typical everyday, non-worst-case instances. A recent model addressing this goal is the algorithms-with-predictions model: each problem instance comes with a possibly error-prone prediction, and the worst-case running time is given as a function of the error in that prediction. This model reflects how recent advances in machine learning are able to make reasonably good predictions on practical ‒ even very complex ‒ datasets. The algorithms-with-predictions model has been used to give strong approximation-ratio guarantees for fundamental online algorithms like scheduling and caching. How to leverage predictions to speed up running time of offline algorithms and data structures has received less attention. This Dagstuhl Seminar aims to bring together researchers from the data structures, combinatorial optimization and learned predictions communities to address the challenges of adopting learned predictions for improving running time guarantees.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Computational geometry is concerned with the design, analysis, and implementation of algorithms for geometric and topological problems, which arise naturally in a wide range of areas, including computer graphics, CAD, robotics, computer vision, image processing, spatial databases, GIS, molecular biology, sensor networks, machine learning, data mining, scientific computing, theoretical computer science, and pure mathematics. Computational geometry is a vibrant and mature field of research, with several dedicated international conferences and journals and strong intellectual connections with other computing and mathematics disciplines. The emphasis of the Dagstuhl Seminar is on presenting recent developments in computational geometry, as well as identifying new challenges, opportunities, and connections to other fields of computing.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Constraint optimization is today a de facto practical approach to efficiently solving various types of NP-hard optimization problems arising from real-world settings. This is primarily due to significant advances in practical algorithms and implementation-level techniques, which have resulted in increasingly efficient and robust constraint optimization solvers for a range of NP-hard declarative languages. However, the need for even more efficient and robust constraint optimization solvers continues to grow, as in several contexts more and more complex optimization problems need to be solved.