Abstract
We prove better lower bounds on additive spanners and emulators, which are lossy compression schemes for undirected graphs, as well as lower bounds on shortcut sets, which reduce the diameter of di...
Funding Information
  • National Science Foundation (CCF-1514383, CCF-1637546, CCF-1815316)

This publication has 19 references indexed in Scilit: