覆盖路径问题在网格上的推广
Generalizing the Covering Path Problem on a Grid
摘要:
研究了R^{2}上的覆盖路径问题.我们推广了以前的结果在一个矩形网格,并证明了覆盖路径成本可以有界的面积和周长的网格。我们分别在一般网格和凸网格上给出了问题的(2+ε)和(1+ε)-近似。
英文摘要:
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+ε) and (1+ε)-approximations for the problem on a general grid and on a convex grid, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。