Pedro Jodrá

Learn 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