In the Planar Connected Face-Dominating Set problem, we are given a plane graph G and asked to find a connected subgraph T of minimum weight, or order, such that the boundary of every face of G contains at least one element ...