A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n:::1+1/k:::) Size in Weighted Graphs

Surender Baswana, Sandeep Sen. A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n:::1+1/k:::) Size in Weighted Graphs. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Volume 2719 of Lecture Notes in Computer Science, pages 384-296, Springer, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.