{"paper":{"title":"Distance Landmarks Revisited for Road Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haixun Wang, Jianxin Li, Jinpeng Huai, Kaiyu Feng, Shuai Ma","submitted_at":"2014-01-13T00:56:12Z","abstract_excerpt":"Computing shortest distances is one of the fundamental problems on graphs, and remains a {\\em challenging} task today. {\\em Distance} {\\em landmarks} have been recently studied for shortest distance queries with an auxiliary data structure, referred to as {\\em landmark} {\\em covers}. This paper studies how to apply distance landmarks for fast {\\em exact} shortest distance query answering on large road graphs. However, the {\\em direct} application of distance landmarks is {\\em impractical} due to the high space and time cost. To rectify this problem, we investigate novel techniques that can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2690","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}