36 citations · 114 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016★ 1 cited
Fast approximation algorithms for -centres in large -hyperbolic graphs
Katherine Edwards, W. Sean Kennedy, Iraj Saniee
We provide a quasilinear time algorithm for the -center problem with an additive error less than or equal to 3 times the input graph's hyperbolic constant. Specifically, for the…
cs.DS2014
Improving Robustness of Next-Hop Routing
Glencora Borradaile, W. Sean Kennedy, Gordon Wilfong +1
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop a…