Locating service and charging stations
From MaRDI portal
Publication:6176545
DOI10.1007/978-3-031-18367-6_1OpenAlexW4312989200MaRDI QIDQ6176545FDOQ6176545
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
Cites Work
- A threshold of ln n for approximating set cover
- Speed is as powerful as clairvoyance
- Polylogarithmic inapproximability
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A General Approximation Technique for Constrained Forest Problems
- A Best Possible Heuristic for the k-Center Problem
- Optimal Location of Discretionary Service Facilities
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Analytical approach to parallel repetition
- Online node-weighted Steiner tree and related problems
- On the hardness of full Steiner tree problems
- Placement of loading stations for electric vehicles: no detours necessary!
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)