Abstract
No abstract available.
Cited By
- Farhan M, Koehler H, Ohms R and Wang Q (2023). Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks, Proceedings of the ACM on Management of Data, 1:4, (1-25), Online publication date: 8-Dec-2023.
- Bläsius T, Freiberger C, Friedrich T, Katzmann M, Montenegro-Retana F and Thieffry M (2022). Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry, ACM Transactions on Algorithms, 18:2, (1-32), Online publication date: 30-Apr-2022.
- Strub M and Gammell J (2022). Adaptively Informed Trees (AIT*) and Effort Informed Trees (EIT*), International Journal of Robotics Research, 41:4, (390-417), Online publication date: 1-Apr-2022.
- Hotz M, Chondrogiannis T, Wörteler L and Grossniklaus M Online Landmark-Based Batch Processing of Shortest Path Queries Proceedings of the 33rd International Conference on Scientific and Statistical Database Management, (133-144)
- Borassi M and Natale E (2019). KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, ACM Journal of Experimental Algorithmics, 24, (1-35), Online publication date: 17-Dec-2019.
- Ismail M, Tarek A, Plaza P, Martin Gomez D, Armingol J and Abdelaziz M Advanced Mapping and Localization for Autonomous Vehicles using OSM 2019 IEEE International Conference of Vehicular Electronics and Safety (ICVES), (1-6)
- Blsius T, Eube J, Feldtkeller T, Friedrich T, Krejca M, Lagodzinski J, Rothenberger R, Severin J, Sommer F and Trautmann J Memory-Restricted Routing with Tiled Map Data 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (3347-3354)
- Sturtevant N, Felner A and Helmert M Value compression of pattern databases Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (912-918)
- Torralba Á, López C and Borrajo D Abstraction heuristics for symbolic bidirectional search Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (3272-3278)
- Riondato M and Kornaropoulos E Fast approximation of betweenness centrality through sampling Proceedings of the 7th ACM international conference on Web search and data mining, (413-422)
- Rice M and Tsotras V Parameterized algorithms for generalized traveling salesman problems in road networks Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (114-123)
- Hliněný P and Mori$#353; O Generalized maneuvers in route planning Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science, (155-166)
- Hliněný P and Moriš O Scope-based route planning Proceedings of the 19th European conference on Algorithms, (445-456)
- Holzer M, Schulz F, Wagner D and Willhalm T (2005). Combining speed-up techniques for shortest-path computations, ACM Journal of Experimental Algorithmics, 10, (2.5-es), Online publication date: 31-Dec-2005.
- Islam F, Narayanan V and Likhachev M A*-Connect: Bounded suboptimal bidirectional heuristic search 2016 IEEE International Conference on Robotics and Automation (ICRA), (2752-2758)
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
A bi-objective iterated local search heuristic with path-relinking for the p-median problem
EMO'11: Proceedings of the 6th international conference on Evolutionary multi-criterion optimizationIn this paper, we examine the p-median problem from a bi-objective point of view. Since this is a NP-Hard problem, an efficient algorithm based on the Iterated Local Search heuristic (ILS) is proposed to determine nondominated solutions (an ...