Pages that link to "Item:Q2941481"

The following pages link to Approximate Distance Oracles with Improved Bounds (Q2941481):

Displaying 12 items.

• Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
• Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
• Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
• On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
• Prioritized Metric Structures and Embedding (Q2941541) (← links)
• A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
• (Q4638107) (← links)
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
• Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
• Optimal (Euclidean) Metric Compression (Q5080486) (← links)
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
• Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)