Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs

Itai Boneh; Shiri Chechik; Shay Golan; Shay Mozes; Oren Weimann

doi:10.1145/3717823.3718249

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs

Itai Boneh
, Shiri Chechik
, Shay Golan
, Shay Mozes
, Oren Weimann

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a labeling scheme that assigns labels of size Õ(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 Õ(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, Õ(1) queries were known only with a centralized oracle of size Õ(n) [SODA 21].

Original language	English
Title of host publication	STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing
Editors	Michal Koucky, Nikhil Bansal
Publisher	Association for Computing Machinery
Pages	2249-2256
Number of pages	8
ISBN (Electronic)	9798400715105
DOIs	https://doi.org/10.1145/3717823.3718249
State	Published - 15 Jun 2025
Event	57th Annual ACM Symposium on Theory of Computing, STOC 2025 - Prague, Czech Republic Duration: 23 Jun 2025 → 27 Jun 2025

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0737-8017

Conference

Conference	57th Annual ACM Symposium on Theory of Computing, STOC 2025
Country/Territory	Czech Republic
City	Prague
Period	23/06/25 → 27/06/25

Bibliographical note

Publisher Copyright:
© 2025 Owner/Author.

Keywords

Approximate distances
Fault-tolerant
Labeling
Planar graphs
Reachability

ASJC Scopus subject areas

Software

Access to Document

10.1145/3717823.3718249

Cite this

Boneh, I., Chechik, S., Golan, S., Mozes, S., & Weimann, O. (2025). Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. In M. Koucky, & N. Bansal (Eds.), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing (pp. 2249-2256). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/3717823.3718249

Boneh, Itai ; Chechik, Shiri ; Golan, Shay et al. / Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. editor / Michal Koucky ; Nikhil Bansal. Association for Computing Machinery, 2025. pp. 2249-2256 (Proceedings of the Annual ACM Symposium on Theory of Computing).

@inproceedings{0217310153d646e791e38ff9b083a6ff,

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 = "English",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "2249--2256",

editor = "Michal Koucky and Nikhil Bansal",

booktitle = "STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing",

address = "United States",

}

Boneh, I, Chechik, S, Golan, S, Mozes, S & Weimann, O 2025, Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. in M Koucky & N Bansal (eds), STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 2249-2256, 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czech Republic, 23/06/25. https://doi.org/10.1145/3717823.3718249

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. / Boneh, Itai; Chechik, Shiri; Golan, Shay et al.
STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. ed. / Michal Koucky; Nikhil Bansal. Association for Computing Machinery, 2025. p. 2249-2256 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs

AU - Boneh, Itai

AU - Chechik, Shiri

AU - Golan, Shay

AU - Mozes, Shay

AU - Weimann, Oren

PY - 2025/6/15

Y1 - 2025/6/15

N2 - We present a labeling scheme that assigns labels of size Õ(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 Õ(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, Õ(1) queries were known only with a centralized oracle of size Õ(n) [SODA 21].

AB - We present a labeling scheme that assigns labels of size Õ(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 Õ(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, Õ(1) queries were known only with a centralized oracle of size Õ(n) [SODA 21].

KW - Approximate distances

KW - Fault-tolerant

KW - Labeling

KW - Planar graphs

KW - Reachability

UR - https://www.scopus.com/pages/publications/105009804218

U2 - 10.1145/3717823.3718249

DO - 10.1145/3717823.3718249

M3 - Conference contribution

AN - SCOPUS:105009804218

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 2249

EP - 2256

BT - STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing

A2 - Koucky, Michal

A2 - Bansal, Nikhil

PB - Association for Computing Machinery

T2 - 57th Annual ACM Symposium on Theory of Computing, STOC 2025

Y2 - 23 June 2025 through 27 June 2025

ER -

Boneh I, Chechik S, Golan S, Mozes S, Weimann O. Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. In Koucky M, Bansal N, editors, STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery. 2025. p. 2249-2256. (Proceedings of the Annual ACM Symposium on Theory of Computing). doi: 10.1145/3717823.3718249

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this