  We consider a variant of the art gallery problem where all guards are limited
to seeing to the right inside a monotone polygon. We call such guards:
half-guards. We provide a polynomial-time approximation for point guarding the
entire monotone polygon. We improve the best known approximation of 40 from
[11], to 8. We also provide an NP-hardness reduction for point guarding a
monotone polygon with half-guards.
