Pedro Jodrá

Learn More
Given an n-vertex convex polygon, we show that a shortest Hamiltonian path visiting all vertices without imposing any restriction on the starting and ending vertices of the path can be found in O(nlogn) time and Θ(n) space. The time complexity increases to O(nlog2 n) for computing this path inside an n-vertex simple polygon. The previous best algorithms for(More)
We consider the problem of computing the recurrence E[O] is known and B = {b(i, j)) and C = (c(j, k)] are known weight Monge matrices of size n x rn and m x n, respectively. We provide an O(m + n)-algorithm for calculating the E[i] values. This algorithm allows us to linearly solve the two following problems: Finding the minimum Hamiltonian curve from point(More)
  • 1