2 papers
cs.DM2026
Graph Distortion Distances, Gromov-Hausdorff and the Hardness of Gromov-Wasserstein
Jens Breitung, Timo Gervens, Julius Pörzgen
We study the computational complexity of graph distortion distances, a family of graph metrics measuring how vertex distances differ between two graphs. Formally, these distances a…
cs.LG2024
End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability
Hinrikus Wolf, Luis Böttcher, Sarra Bouchkati +9
In the course of the energy transition, the expansion of generation and consumption will change, and many of these technologies, such as PV systems, electric cars and heat pumps, w…