12 citations · 29 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Holiest Minimum-Cost Paths and Flows in Surface Graphs
Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren
Let be an edge-weighted directed graph with vertices embedded on an orientable surface of genus . We describe a simple deterministic lexicographic perturbation scheme th…
cs.DS2012★ 1 cited
Necklaces, Convolutions, and X+Y
David Bremner, Timothy M. Chan, Erik D. Demaine +6
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alig…