A Dynamic Programming Solution to the Monotonic Path of Minimal Cost in a 3-Rows Matrix
Data Structures and Algorithms
2013-10-18 v1
Abstract
We consider the problem of finding the path of minimal cost going from left to right in a 3-rows matrix, starting at the third row, and not going downwards, where there is an additional cost related to not changing rows, such that the higher the change in intensity within the row, the higher the cost of not moving upwards.
Cite
@article{arxiv.1310.4541,
title = {A Dynamic Programming Solution to the Monotonic Path of Minimal Cost in a 3-Rows Matrix},
author = {Marcelo Cicconet and Davi Geiger},
journal= {arXiv preprint arXiv:1310.4541},
year = {2013}
}
Comments
1 page, 1 figure