Pages that link to "Item:Q3581551"
From MaRDI portal
The following pages link to Spanners and emulators with sublinear distance errors (Q3581551):
Displaying 21 items.
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- New pairwise spanners (Q1693988) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Preprocess, set, query! (Q2017874) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Deterministic improved round-trip spanners (Q2410583) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- (Q5009573) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Improved weighted additive spanners (Q6096039) (← links)
