Greedy spanners in Euclidean spaces admit sublinear separators

DOI10.1137/1.9781611977073.130MaRDI QIDQ6575211zbMATH OpenFDO

Authors Hung Le, Cuong Than

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.130

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Greedy spanners are optimal in doubling metrics
• The greedy spanner is existentially optimal
• Computing the Greedy Spanner in Near-Quadratic Time
• The greedy spanner is existentially optimal (extended abstract)

Cited in

(2)

• Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
• Map-matching queries under Fréchet distance on low-density spanners

This page was built for publication: Greedy spanners in Euclidean spaces admit sublinear separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575211)