Learn More
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedily rearranges the search path to minimize the cost of future(More)
We consider scheduling jobs online to minimize the objective i∈[n] wig(Ci − ri), where wi is the weight of job i, ri is its release time, Ci is its completion time and g is any non-decreasing convex function. Previously, it was known that the clairvoyant algorithm Highest-Density-First (HDF) is (2 +)-speed O(1)-competitive for this objective on a single(More)
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in g O(g) n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Ł ˛ acki and Sankowski, for(More)
We give the first subquadratic-time approximation schemes for dynamic time warping (DTW) and edit distance (ED) of several natural families of point sequences in R d , for any fixed d ≥ 1. In particular, our algorithms compute (1 + ε)-approximations of DTW and ED in time near-linear for point sequences drawn from k-packed or k-bounded curves, and(More)