The following pages link to Approximate distance oracles (Q3546311):
Displaying 50 items.
- Topology recognition with advice (Q259077) (← links)
- Consistency thresholds for the planted bisection model (Q287720) (← links)
- Distance oracles for time-dependent networks (Q289929) (← links)
- Succinct posets (Q329288) (← links)
- Drawing maps with advice (Q433400) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Electric routing and concurrent flow cutting (Q553348) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Communication algorithms with advice (Q972382) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
- New pairwise spanners (Q1693988) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem (Q1932671) (← links)
- An introduction to the Ribe program (Q1936714) (← links)
- Ultrametric subsets with large Hausdorff dimension (Q1949226) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Preprocess, set, query! (Q2017874) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- An axiomatic approach to time-dependent shortest path oracles (Q2118212) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- On random perfect matchings in metric spaces with not-too-large diameters (Q2158300) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- Quantum spectrum testing (Q2231675) (← links)
