Better lower bounds for shortcut sets and additive spanners via an improved alternation product

DOI10.1137/1.9781611977073.131MaRDI QIDQ6575212zbMATH OpenFDO

Authors Kevin W. Lu, Virginia Vassilevska Williams, Nicole Wein

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Additive spanner lower bounds with optimal inner graph structure
• Giving some slack: shortcuts and transitive closure compressions

This page was built for publication: Better lower bounds for shortcut sets and additive spanners via an improved alternation product

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