@inproceedings{1a16d9b27cbb45bc95bd4cc764d46c9b,
title = "{\~O}ptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs",
abstract = "We present a labeling scheme that assigns labels of size {\~O}(1) to the vertices of a directed weighted planar graph G, such that for any fixed ϵ>0 from the labels of any three vertices s, t and f one can determine in {\~O}(1) time a (1+ϵ)-approximation of the s-to-t distance in the graph Gλ\{f\}. For approximate distance queries, prior to our work, no efficient solution existed, not even in the centralized oracle setting. Even for the easier case of reachability, {\~O}(1) queries were known only with a centralized oracle of size {\~O}(n) [SODA 21].",
keywords = "Approximate distances, Fault-tolerant, Labeling, Planar graphs, Reachability",
author = "Itai Boneh and Shiri Chechik and Shay Golan and Shay Mozes and Oren Weimann",
note = "Publisher Copyright: {\textcopyright} 2025 Owner/Author.; 57th Annual ACM Symposium on Theory of Computing, STOC 2025 ; Conference date: 23-06-2025 Through 27-06-2025",
year = "2025",
month = jun,
day = "15",
doi = "10.1145/3717823.3718249",
language = "אנגלית",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "2249--2256",
editor = "Michal Koucky and Nikhil Bansal",
booktitle = "STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing",
}