A Closer Cut: Computing Near-Optimal Lawn Mowing Tours

Sándor P. Fekete, Dominik Krupke, Michael Perk +2

For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1 of every point in $P$; this is equivalent to comp…