2 papers
cs.DS2025
Search Trees on Trees via LP
Yaniv Sadeh, Haim Kaplan, Uri Zwick
We consider the problem of computing optimal search trees on trees (STTs). STTs generalize binary search trees (BSTs) in which we search nodes in a path (linear order) to search tr…
cs.DS2025
Faster All-Pairs Optimal Electric Car Routing
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +2
We present a randomized -time algorithm for computing \emph{optimal energetic paths} for an electric car between all pairs of vertices in an -vertex directed…