Emergency Vertex Cover
The Emergency Vertex Cover (Em-VC) problem is introduced, where an edge may be covered not only by its endpoints, but also by a distant vertex, provided the vertex is given sufficient power to "cover" the cumulative weight of the edges along a shortest path to one of the edge's endpoints plus the weight of the edge.