The following pages link to STACS 2005 (Q5710717):
Displaying 7 items.
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
