STACS 2005
From MaRDI portal
Publication:5710717
DOI10.1007/b106485zbMath1118.05311OpenAlexW4230940848MaRDI QIDQ5710717
Vishrut Goyal, Surender Baswana, Sandeep Sen
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs ⋮ Faster algorithms for all-pairs small stretch distances in weighted graphs ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Approximating Shortest Paths in Graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs ⋮ Fast approximate shortest paths in the congested clique
