All-Pairs Nearly 2-Approximate Shortest-Paths in O(n:::2::: polylog n) Time - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Surender Baswana, Vishrut Goyal, Sandeep Sen. All-Pairs Nearly 2-Approximate Shortest-Paths in O(n:::2::: polylog n) Time. In Volker Diekert, Bruno Durand, editors, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Volume 3404 of Lecture Notes in Computer Science, pages 666-679, Springer, 2005. [doi]

This author has not been identified. Look up 'Surender Baswana' in GoogleThis author has not been identified. Look up 'Vishrut Goyal' in GoogleThis author has not been identified. Look up 'Sandeep Sen' in Google

runs on WebDSL