Image de couverture de livre

Directed Buy-at-Bulk Spanners

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Grigorescu, Elena, Kumar, Nithish, Lin, Young-San
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Routing-Controlled Spanners
par: Grigorescu, Elena, et autres
Publié: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
par: Grigorescu, Elena, et autres
Publié: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
par: Grigorescu, Elena, et autres
Publié: (2024)

New Greedy Spanners and Applications
par: Popova, Elizaveta, et autres
Publié: (2026)

Graph Spanners for Group Steiner Distances
par: Bilò, Davide, et autres
Publié: (2024)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Multiplicative Spanners in Minor-Free Graphs
par: Bodwin, Greg, et autres
Publié: (2025)

Approximate Light Spanners in Planar Graphs
par: Le, Hung, et autres
Publié: (2025)

Almost-Optimal Sublinear Additive Spanners
par: Tan, Zihan, et autres
Publié: (2023)

A Unified Framework for Hopsets and Spanners
par: Neiman, Ofer, et autres
Publié: (2021)

Shortcuts and Transitive-Closure Spanners Approximation
par: Chalermsook, Parinya, et autres
Publié: (2025)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
par: Chekuri, Chandra, et autres
Publié: (2024)

A Simple Dynamic Spanner via APSP
par: Kyng, Rasmus, et autres
Publié: (2024)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Greedy Completion for Weighted $(α,β)$-Spanners
par: Tzalik, Elad
Publié: (2026)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
par: He, Jialin, et autres
Publié: (2025)

Lightweight Near-Additive Spanners
par: Gitlitz, Yuval, et autres
Publié: (2024)

A Lower Bound for Light Spanners in General Graphs
par: Bodwin, Greg, et autres
Publié: (2024)

Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees
par: Ahmed, Reyan, et autres
Publié: (2024)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
par: Qi, Chuhan
Publié: (2025)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
par: Turoczy, Alexander, et autres
Publié: (2025)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
par: Bodwin, Greg, et autres
Publié: (2024)

Parks and Recreation: Color Fault-Tolerant Spanners Made Local
par: Parter, Merav, et autres
Publié: (2024)

The Complexity of Geodesic Spanners
par: de Berg, Sarita, et autres
Publié: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Differential privacy and Sublinear time are incompatible sometimes
par: Blocki, Jeremiah, et autres
Publié: (2024)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
par: Chuzhoy, Julia, et autres
Publié: (2026)

Light Spanners with Small Hop-Diameter
par: Bhore, Sujoy, et autres
Publié: (2025)

Dynamic Light Spanners in Doubling Metrics
par: Bhore, Sujoy, et autres
Publié: (2026)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

The Complexity of Geodesic Spanners using Steiner Points
par: de Berg, Sarita, et autres
Publié: (2024)

How to Reduce Temporal Cliques to Find Sparse Spanners
par: Angrick, Sebastian, et autres
Publié: (2024)

Spanner for the $0/1/\infty$ weighted region problem
par: Gudmundsson, Joachim, et autres
Publié: (2024)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
par: La, An, et autres
Publié: (2025)

Hardness of Maximum Likelihood Learning of DPPs
par: Grigorescu, Elena, et autres
Publié: (2022)

Light Edge Fault Tolerant Graph Spanners
par: Bodwin, Greg, et autres
Publié: (2025)

An Alternate Proof of Near-Optimal Light Spanners
par: Bodwin, Greg
Publié: (2023)

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
par: Chen, Yeyuan
Publié: (2024)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
par: Chen, Ho-Lin, et autres
Publié: (2026)