Suppose you are given this algorithm:

Start at the western end of the road and begin moving east until the first moment when there is a house h exactly four miles to the west. Place a base station at this point (if you go any further east without placing a base station, you would not cover h). Then delete all the houses covered by this base station and iterate this process on the remaining houses.