28 citations · 244 across the 83 of their papers we have counts for
3 papers · 2 filters
Hollow Heaps
Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan +1
We introduce the hollow heap, a very simple data structure with the same amortized efficiency as the classical Fibonacci heap. All heap operations except delete and delete-min take…
The Temp Secretary Problem
Amos Fiat, Ilia Gorelik, Haim Kaplan +1
We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration. This models online hiring of temporary employees, or online auctions…
On the Complexity of Hub Labeling
Maxim Babenko, Andrew V. Goldberg, Haim Kaplan +2
Hub Labeling (HL) is a data structure for distance oracles. Hierarchical HL (HHL) is a special type of HL, that received a lot of attention from a practical point of view. However,…