10 citations · 16 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009★ 6 cited
Deterministic approximation for the cover time of trees
Uriel Feige, Ofer Zeitouni
We present a deterministic algorithm that given a tree T with n vertices, a starting vertex v and a slackness parameter epsilon > 0, estimates within an additive error of epsilon t…
cs.DS2009
Interchanging distance and capacity in probabilistic mappings
Reid Andersen, Uriel Feige
Harald Racke [STOC 2008] described a new method to obtain hierarchical decompositions of networks in a way that minimizes the congestion. Racke's approach is based on an equivalenc…