Węgrzycki, Karol
(2021-02-10)
In this thesis we study an application of dynamic programming technique to graph problems and approximation algorithms. We improve upon
state-of-the-art algorithms for All-Nodes Shortest Cycles, distance oracles, approximate ...