If we imagine city with proper block then graph will be somewhat like n*m grid with intersection point as vertex.
So we have to find an vertex where absence of ambulance would cause problem. This is similary to finding minimum number of vertex such that each edge is covered.
Hence answer would be finding vertex cover.