3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
An approach that separates geometric visibility preprocessing from a portfolio of incremental combinatorial searches is described, complemented by exact discrete one-swap descent, ruin-and-recreate, and elite crossover.
For $p \ge 1$, the $p$-Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p$th power of their distance. For discrete distributions in one dimension, full transport is especially simple: after sorting, mass is matche...
The first sublinear approximation algorithm for the minimum dilation tree in the Euclidean plane is given, whose approximation ratio is $\tilde{O}(n^{14/15})$ and the algorithm runs in polynomial time.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
