Pages that link to "Item:Q1001904"
From MaRDI portal
The following pages link to All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904):
Displaying 8 items.
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- On the all-pairs-shortest-path problem in unweighted undirected graphs. (Q960518) (← links)
- A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time (Q1944395) (← links)
- (Q4636506) (← links)
- (Q4694733) (← links)
- (Q4887753) (← links)
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS (Q5249020) (← links)
- STACS 2005 (Q5710717) (← links)