Locating service and charging stations

DOI10.1007/978-3-031-18367-6_1MaRDI QIDQ6176545zbMATH OpenOpenAlexFDO

Authors Rajni Dabas, Naveen Garg, Neelima Gupta, 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

approximation algorithmsfacility location

Mathematics Subject Classification ID

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

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A General Approximation Technique for Constrained Forest Problems
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A threshold of ln n for approximating set cover
• Analytical approach to parallel repetition
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• On the hardness of full Steiner tree problems
• Online node-weighted Steiner tree and related problems
• Optimal Location of Discretionary Service Facilities
• Placement of loading stations for electric vehicles: no detours necessary!
• Polylogarithmic inapproximability
• Speed is as powerful as clairvoyance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176545)