Locating battery charging stations to facilitate almost shortest paths

DOI10.1016/j.dam.2018.07.019zbMath1404.05094OpenAlexW2889084514WikidataQ129365976 ScholiaQ129365976MaRDI QIDQ1720301

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

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4750/

zbMATH Keywords

optimizationshortest pathsapproximation algorithmsspanners

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Distance in graphs (05C12) Approximation algorithms (68W25)

Cites Work

• Stable roommates spanner
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• Unit disk graphs
• Classes of graphs which approximate the complete Euclidean graph
• Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
• Geometric Spanner Networks
• Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
• Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• An Efficient Algorithm for Placing Electric Vehicle Charging Stations.
• Simple heuristics for unit disk graphs
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Locating battery charging stations to facilitate almost shortest paths