8 citations · 31 across the 9 of their papers we have counts for
4 papers · 1 filter
Minimum Cuts in Surface Graphs
Erin W. Chambers, Jeff Erickson, Kyle Fox +1
We describe algorithms to efficiently compute minimum -cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph with $…
Approximating the Geometric Edit Distance
Kyle Fox, Xinyi Li
Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as si…
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
Kyle Fox, Jiashuai Lu
The geometric transportation problem takes as input a set of points in -dimensional Euclidean space and a supply function . The goal is to find a transp…
Faster Algorithms for the Geometric Transportation Problem
Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi +2
Let and be two point sets in , with and where is a constant. Next, let such that $\sum_{r \in R } λ(r) = \sum_…