Locating service and charging stations

DOI10.1007/978-3-031-18367-6_1OpenAlexW4312989200MaRDI QIDQ6176545

Naveen Garg, Neelima Gupta, Rajni Dabas, Dilpreet Kaur

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-18367-6_1

zbMATH Keywords

facility locationapproximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• On the hardness of full Steiner tree problems
• Placement of Loading Stations for Electric Vehicles: No Detours Necessary!
• A threshold of ln n for approximating set cover
• Polylogarithmic inapproximability
• A Best Possible Heuristic for the k-Center Problem
• Optimal Location of Discretionary Service Facilities
• Speed is as powerful as clairvoyance
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A General Approximation Technique for Constrained Forest Problems
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Analytical approach to parallel repetition
• Online Node-Weighted Steiner Tree and Related Problems

This page was built for publication: Locating service and charging stations