#### Filter Results:

#### Publication Year

2011

2016

#### Co-author

#### Key Phrase

#### Publication Venue

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)

Due to its optimality on a single machine for the problem of minimizing average flow time, Shortest-Remaining-Processing-Time (SRPT) appears to be the most natural algorithm to consider for the problem of minimizing average flow time on multiple identical machines. It is known that SRPT achieves the best possible competitive ratio on multiple machines up to… (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)

In this paper, we consider scheduling parallelizable jobs in the non-clairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount of resource augmentation over the optimal solution. However,… (More)

Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of non-trivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest non-separating cycle in 2 O(g) n log log n time. Similar… (More)

- Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent +1 other
- LATIN
- 2014

We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.

Let G be a directed graph embedded on a surface of genus g with b boundary cycles. We describe an algorithm to compute the shortest non-contractible cycle in G in O((g 3 + g b)n log n) time. Our algorithm improves the previous best known time bound of (g + b) O(g+b) n log n for all positive g and b. We also describe an algorithm to compute the shortest… (More)

We present the first subquadratic algorithms for computing similarity between a pair of point sequences in R d , for any fixed d > 1, using dynamic time warping (DTW) and edit distance, assuming that the point sequences are drawn from certain natural families of curves. In particular , our algorithms compute (1 + ε)-approximations of DTW and ED in… (More)

It is well-known that SRPT is optimal for minimizing flow time on machines that run one job at a time. However, running one job at a time is a big under-utilization for modern systems where sharing, simultaneous execution, and virtualization-enabled consolidation are a common trend to boost utilization. Such machines, used in modern large data centers and… (More)