We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+\epsilon) and (1+\epsilon)-approximations for the problem on a general grid and on a convex grid, respectively.
@article{arxiv.1904.12258,
title = {Generalizing the Covering Path Problem on a Grid},
author = {Liwei Zeng and Karen Smilowitz and Sunil Chopra},
journal= {arXiv preprint arXiv:1904.12258},
year = {2019}
}