Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
Numerische Mathematik , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Supervised learning on states collected from ERCSPP relaxations identifies dominant states effectively within instances but shows declining performance on unseen instances.
citing papers explorer
-
A Coalgebraic Dijkstra Algorithm
Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.
-
Learning Dominant States in Elementary Resource Constrained Shortest Path Problems
Supervised learning on states collected from ERCSPP relaxations identifies dominant states effectively within instances but shows declining performance on unseen instances.