Imagen de Portada

Routing-Controlled Spanners

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Grigorescu, Elena, Kumar, Nithish Kumar, Lin, Young-San
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Directed Buy-at-Bulk Spanners
por: Grigorescu, Elena, et al.
Publicado: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
por: Grigorescu, Elena, et al.
Publicado: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
por: Grigorescu, Elena, et al.
Publicado: (2024)

New Greedy Spanners and Applications
por: Popova, Elizaveta, et al.
Publicado: (2026)

Graph Spanners for Group Steiner Distances
por: Bilò, Davide, et al.
Publicado: (2024)

Minimum Temporal Spanners in Happy Graphs
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Multiplicative Spanners in Minor-Free Graphs
por: Bodwin, Greg, et al.
Publicado: (2025)

Approximate Light Spanners in Planar Graphs
por: Le, Hung, et al.
Publicado: (2025)

Almost-Optimal Sublinear Additive Spanners
por: Tan, Zihan, et al.
Publicado: (2023)

A Unified Framework for Hopsets and Spanners
por: Neiman, Ofer, et al.
Publicado: (2021)

Shortcuts and Transitive-Closure Spanners Approximation
por: Chalermsook, Parinya, et al.
Publicado: (2025)

A Simple Dynamic Spanner via APSP
por: Kyng, Rasmus, et al.
Publicado: (2024)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Greedy Completion for Weighted $(α,β)$-Spanners
por: Tzalik, Elad
Publicado: (2026)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Lightweight Near-Additive Spanners
por: Gitlitz, Yuval, et al.
Publicado: (2024)

A Lower Bound for Light Spanners in General Graphs
por: Bodwin, Greg, et al.
Publicado: (2024)

Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees
por: Ahmed, Reyan, et al.
Publicado: (2024)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
por: Qi, Chuhan
Publicado: (2025)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
por: Turoczy, Alexander, et al.
Publicado: (2025)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
por: Bodwin, Greg, et al.
Publicado: (2024)

Parks and Recreation: Color Fault-Tolerant Spanners Made Local
por: Parter, Merav, et al.
Publicado: (2024)

The Complexity of Geodesic Spanners
por: de Berg, Sarita, et al.
Publicado: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Differential privacy and Sublinear time are incompatible sometimes
por: Blocki, Jeremiah, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

Dynamic Light Spanners in Doubling Metrics
por: Bhore, Sujoy, et al.
Publicado: (2026)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

The Complexity of Geodesic Spanners using Steiner Points
por: de Berg, Sarita, et al.
Publicado: (2024)

How to Reduce Temporal Cliques to Find Sparse Spanners
por: Angrick, Sebastian, et al.
Publicado: (2024)

Spanner for the $0/1/\infty$ weighted region problem
por: Gudmundsson, Joachim, et al.
Publicado: (2024)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
por: La, An, et al.
Publicado: (2025)

Hardness of Maximum Likelihood Learning of DPPs
por: Grigorescu, Elena, et al.
Publicado: (2022)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

An Alternate Proof of Near-Optimal Light Spanners
por: Bodwin, Greg
Publicado: (2023)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
por: Schild, Aaron, et al.
Publicado: (2025)

The Local Information Cost of Distributed Graph Spanners
por: Robinson, Peter
Publicado: (2020)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
por: Chen, Yeyuan
Publicado: (2024)

Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing
por: Uroić, Leon Stjepan, et al.
Publicado: (2026)