Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Reut Levi; Moti Medina; Omer Tubul

doi:10.4230/LIPIcs.APPROX/RANDOM.2024.60

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Reut Levi, Moti Medina, Omer Tubul

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

Abstract

In this paper, we study the problem of locally constructing a sparse spanning subgraph (LSSG), introduced by Levi, Ron, and Rubinfeld (ALGO’20). In this problem, the goal is to locally decide for each e ∈ E if it is in G^′ where G^′ is a connected subgraph of G (determined only by G and the randomness of the algorithm). We provide an LSSG that receives as a parameter a lower bound, ϕ, on the conductance of G whose query complexity is Õ(√n/ϕ²). This is almost optimal when ϕ is a constant since Ω(√n) queries are necessary even when G is an expander. Furthermore, this improves the state of the art of Õ(n²/³) queries for ϕ = Ω(1/n¹/¹²). We then extend our result for (k, ϕin, ϕout)-clusterable graphs and provide an algorithm whose query complexity is Õ(√n + ϕoutn) for constant k and ϕin. This bound is almost optimal when ϕout = O(1/√n).

Original language	English
Title of host publication	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024
Editors	Amit Kumar, Noga Ron-Zewi
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959773485
DOIs	https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.60
State	Published - Sep 2024
Event	27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024 - London, United Kingdom Duration: 28 Aug 2024 → 30 Aug 2024

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	317
ISSN (Print)	1868-8969

Conference

Conference	27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024
Country/Territory	United Kingdom
City	London
Period	28/08/24 → 30/08/24

Bibliographical note

Publisher Copyright:
© Reut Levi, Moti Medina, and Omer Tubul.

Keywords

Clusterbale Graphs
Locally Computable Algorithms
Spanning Subgraphs
Sublinear algorithms

Access to Document

10.4230/LIPIcs.APPROX/RANDOM.2024.60

Cite this

Levi, R., Medina, M., & Tubul, O. (2024). Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. In A. Kumar, & N. Ron-Zewi (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024 Article 60 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 317). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.60

Levi, Reut ; Medina, Moti ; Tubul, Omer. / Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. editor / Amit Kumar ; Noga Ron-Zewi. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2024. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{95ac9f3ba2a4417089a20117b39bb011,

title = "Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs",

abstract = "In this paper, we study the problem of locally constructing a sparse spanning subgraph (LSSG), introduced by Levi, Ron, and Rubinfeld (ALGO{\textquoteright}20). In this problem, the goal is to locally decide for each e ∈ E if it is in G′ where G′ is a connected subgraph of G (determined only by G and the randomness of the algorithm). We provide an LSSG that receives as a parameter a lower bound, ϕ, on the conductance of G whose query complexity is {\~O}(√n/ϕ2). This is almost optimal when ϕ is a constant since Ω(√n) queries are necessary even when G is an expander. Furthermore, this improves the state of the art of {\~O}(n2/3) queries for ϕ = Ω(1/n1/12). We then extend our result for (k, ϕin, ϕout)-clusterable graphs and provide an algorithm whose query complexity is {\~O}(√n + ϕoutn) for constant k and ϕin. This bound is almost optimal when ϕout = O(1/√n).",

keywords = "Clusterbale Graphs, Locally Computable Algorithms, Spanning Subgraphs, Sublinear algorithms",

author = "Reut Levi and Moti Medina and Omer Tubul",

note = "Publisher Copyright: {\textcopyright} Reut Levi, Moti Medina, and Omer Tubul.; 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024 ; Conference date: 28-08-2024 Through 30-08-2024",

year = "2024",

month = sep,

doi = "10.4230/LIPIcs.APPROX/RANDOM.2024.60",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Amit Kumar and Noga Ron-Zewi",

booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024",

address = "גרמניה",

}

Levi, R, Medina, M & Tubul, O 2024, Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. in A Kumar & N Ron-Zewi (eds), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024., 60, Leibniz International Proceedings in Informatics, LIPIcs, vol. 317, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024, London, United Kingdom, 28/08/24. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.60

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. / Levi, Reut; Medina, Moti; Tubul, Omer.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. ed. / Amit Kumar; Noga Ron-Zewi. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2024. 60 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 317).

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

TY - GEN

T1 - Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

AU - Levi, Reut

AU - Medina, Moti

AU - Tubul, Omer

N1 - Publisher Copyright: © Reut Levi, Moti Medina, and Omer Tubul.

PY - 2024/9

Y1 - 2024/9

N2 - In this paper, we study the problem of locally constructing a sparse spanning subgraph (LSSG), introduced by Levi, Ron, and Rubinfeld (ALGO’20). In this problem, the goal is to locally decide for each e ∈ E if it is in G′ where G′ is a connected subgraph of G (determined only by G and the randomness of the algorithm). We provide an LSSG that receives as a parameter a lower bound, ϕ, on the conductance of G whose query complexity is Õ(√n/ϕ2). This is almost optimal when ϕ is a constant since Ω(√n) queries are necessary even when G is an expander. Furthermore, this improves the state of the art of Õ(n2/3) queries for ϕ = Ω(1/n1/12). We then extend our result for (k, ϕin, ϕout)-clusterable graphs and provide an algorithm whose query complexity is Õ(√n + ϕoutn) for constant k and ϕin. This bound is almost optimal when ϕout = O(1/√n).

AB - In this paper, we study the problem of locally constructing a sparse spanning subgraph (LSSG), introduced by Levi, Ron, and Rubinfeld (ALGO’20). In this problem, the goal is to locally decide for each e ∈ E if it is in G′ where G′ is a connected subgraph of G (determined only by G and the randomness of the algorithm). We provide an LSSG that receives as a parameter a lower bound, ϕ, on the conductance of G whose query complexity is Õ(√n/ϕ2). This is almost optimal when ϕ is a constant since Ω(√n) queries are necessary even when G is an expander. Furthermore, this improves the state of the art of Õ(n2/3) queries for ϕ = Ω(1/n1/12). We then extend our result for (k, ϕin, ϕout)-clusterable graphs and provide an algorithm whose query complexity is Õ(√n + ϕoutn) for constant k and ϕin. This bound is almost optimal when ϕout = O(1/√n).

KW - Clusterbale Graphs

KW - Locally Computable Algorithms

KW - Spanning Subgraphs

KW - Sublinear algorithms

UR - http://www.scopus.com/inward/record.url?scp=85204460551&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.APPROX/RANDOM.2024.60

DO - 10.4230/LIPIcs.APPROX/RANDOM.2024.60

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85204460551

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024

A2 - Kumar, Amit

A2 - Ron-Zewi, Noga

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 27th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2024 and the 28th International Conference on Randomization and Computation, RANDOM 2024

Y2 - 28 August 2024 through 30 August 2024

ER -

Levi R, Medina M, Tubul O. Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. In Kumar A, Ron-Zewi N, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2024. 60. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.APPROX/RANDOM.2024.60

Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this