עופר נימן

אקדמי בכיר

Near-Additive Spanners and Near-Exact Hopsets, A Unified View

Given an unweighted undirected graph G = (V, E), and a pair of parameters ε > 0, β = 1, 2, . . ., a subgraph G 0 = (V, H), H ⊆ E, of G is a (1 + ε, β)-spanner (aka, a near-additive spanner) of G if for every u, v ∈ V ,
שפת פרסום אנגלית
כרך 130
סטטוס פרסום פורסם - 21.01.2020

Keywords

Computer Science - Data Structures and Algorithms
גישה למסמך
10.48550/arXiv.2001.07477