1 code implementation • 17 Apr 2018 • André Berger, László Kozma, Matthias Mnich, Roland Vincze
In this paper we improve upon the Cosmadakis-Papadimitriou algorithm, giving an MV-TSP algorithm that runs in time $2^{O(n)}$, i. e.\ \emph{single-exponential} in the number of cities, using \emph{polynomial} space.
Data Structures and Algorithms
1 code implementation • 15 Feb 2018 • László Kozma, Thatchaphol Saranurak
Through our connection, we transfer all instance-specific lower bounds known for BSTs to a general model of heaps, initiating a theory of dynamic optimality for heaps.
Data Structures and Algorithms Combinatorics
