4 papers
How to Reduce Temporal Cliques to Find Sparse Spanners
Sebastian Angrick, Ben Bals, Tobias Friedrich +7
Many real-world networks, such as transportation or trade networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This be…
Learning Languages with Decidable Hypotheses
Julian Berger, Maximilian Böther, Vanja Doskoč +9
In language learning in the limit, the most common type of hypothesis is to give an enumerator for a language. This so-called -index allows for naming arbitrary computably enume…
Maps for Learning Indexable Classes
Julian Berger, Maximilian Böther, Vanja Doskoč +9
We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the language…
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck +9
Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have un…