Locating battery charging stations to facilitate almost shortest paths

Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S.B. Mitchell, Michael Segal

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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 stations, subject to the t-spanning constraint. We study two versions of the problem, one in which the stations are required to support a single ride (to a single destination), and one in which the stations are to support multiple rides through a sequence of destinations, where the destinations are revealed one at a time.

Original languageEnglish
Pages (from-to)10-16
Number of pages7
JournalDiscrete Applied Mathematics
StatePublished - 15 Feb 2019


  • Approximation algorithms
  • Optimization
  • Shortest paths
  • Spanners

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Locating battery charging stations to facilitate almost shortest paths'. Together they form a unique fingerprint.

Cite this