{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:14:56Z","timestamp":1758672896737,"version":"3.44.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>We consider the problem of quickly providing strong lower bounds for the planar Euclidean shortest path (ESP) problem. Such lower bounds are crucial for guiding the search in A* type approaches or for proving quality guarantees for algorithms that compute approximate solutions.\n\nOur contributions are two-fold: we show how to simplify ESP instances such that computing and storing a visibility graph becomes feasible while distances within the simplified instance are guaranteed to constitute lower bounds for the original problem instance. Furthermore we show how to precompute a space efficient data structure that allows to perform distance queries on visibility graphs within few microseconds with negligible space overhead.<\/jats:p>","DOI":"10.24963\/ijcai.2025\/946","type":"proceedings-article","created":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:10:40Z","timestamp":1758269440000},"page":"8510-8517","source":"Crossref","is-referenced-by-count":0,"title":["Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths"],"prefix":"10.24963","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Koch","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudius","family":"Proissl","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Staib","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Weitbrecht","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"34","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2025","name":"Thirty-Fourth International Joint Conference on Artificial Intelligence {IJCAI-25}","start":{"date-parts":[[2025,8,16]]},"theme":"Artificial Intelligence","location":"Montreal, Canada","end":{"date-parts":[[2025,8,22]]}},"container-title":["Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T11:35:35Z","timestamp":1758627335000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2025\/946"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2025\/946","relation":{},"subject":[],"published":{"date-parts":[[2025,9]]}}}