We study a facility location problem motivated by requirements pertaining to the distribution
of charging stations for electric vehicles: Place a minimum number of battery charging
stations at a subset of nodes of a network, so that battery-powered electric vehicles will be
able to move between destinations using “t-spanning” routes, of lengths within a factor t> 1
of the length of a shortest path, while having sufficient charging stations along the way. We
give constant-factor approximation algorithms for minimizing the number of charging …

We study a facility location problem motivated by requirements pertaining to the distribution
of charging stations for electric vehicles: Place a minimum number of battery charging
stations at a subset of nodes of a network, so that battery-powered electric vehicles will be
able to move between destinations using" t-spanning" routes, of lengths within a factor t> 1
of the length of a shortest path, while having sufficient charging stations along the way. We
give constant-factor approximation algorithms for minimizing the number of charging …