Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
Fuente:
arXiv
Saved in:
| Main Authors: | Biniaz, Ahmad, De Carufel, Jean-Lou, Maheshwari, Anil, Smid, Michiel |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)
by: Biniaz, Ahmad, et al.
Published: (2025)
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)
by: Biniaz, Ahmad, et al.
Published: (2025)
Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)
by: Aloupis, Greg, et al.
Published: (2024)
Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)
by: Akitaya, Hugo A., et al.
Published: (2025)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)
by: De Carufel, Jean-Lou, et al.
Published: (2025)
Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)
by: Bose, Prosenjit, et al.
Published: (2025)
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)
by: Biniaz, Ahmad, et al.
Published: (2023)
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025)
by: La, An, et al.
Published: (2025)
Hop-Spanners for Geometric Intersection Graphs
by: Conroy, Jonathan B., et al.
Published: (2021)
by: Conroy, Jonathan B., et al.
Published: (2021)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)
by: De, Minati, et al.
Published: (2023)
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)
by: Dutta, Madhura, et al.
Published: (2025)
Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)
by: Buchin, Kevin, et al.
Published: (2023)
The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Generalized Sweeping Line Spanners
by: Lee, Keenan, et al.
Published: (2021)
by: Lee, Keenan, et al.
Published: (2021)
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)
by: Le, Hung, et al.
Published: (2023)
Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)
by: Maheshwari, Anil, et al.
Published: (2026)
Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)
by: Akitaya, Hugo A., et al.
Published: (2024)
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
New Lower Bound and Algorithms for Online Geometric Hitting Set Problem
by: De, Minati, et al.
Published: (2024)
by: De, Minati, et al.
Published: (2024)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023)
Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024)
by: Khodabandeh, Hadi, et al.
Published: (2024)
The Complexity of Geodesic Spanners using Steiner Points
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)
by: Gudmundsson, Joachim, et al.
Published: (2024)
Towards Instance-Optimal Euclidean Spanners
by: Le, Hung, et al.
Published: (2024)
by: Le, Hung, et al.
Published: (2024)
So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
Similar Items
-
Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025) -
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024) -
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025) -
Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024) -
Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)