28 citations · 244 across the 83 of their papers we have counts for
36 papers · 1 filter
Minimum-cost paths for electric cars
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +2
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different c…
Caching Connections in Matchings
Yaniv Sadeh, Haim Kaplan
Motivated by the desire to utilize a limited number of configurable optical switches by recent advances in Software Defined Networks (SDNs), we define an online problem which we ca…
Optimal energetic paths for electric cars
Dani Dorfman, Haim Kaplan, Robert E. Tarjan +1
A weighted directed graph , where and , describes a road network in which an electric car can roam. An arc models a road segment co…
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
Yaniv Sadeh, Haim Kaplan
Binary search trees (BSTs) are one of the most basic and widely used data structures. The best static tree for serving a sequence of queries (searches) can be computed by dynamic p…
Fast approximation of search trees on trees with centroid trees
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan +1
Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a p…
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
We study the online facility location problem with uniform facility costs in the random-order model. Meyerson's algorithm [FOCS'01] is arguably the most natural and simple online a…