Brief Announcement

Abstract

This brief announcement presents an algorithm for (1 + ) approximate single-source shortest paths for directed graphs with non-negative real edge weights in the CONGEST model that runs in˜(( 1/2 + + 2/5+ (1) 2/5 ) log / 2 ) rounds, where is the ratio between the largest and smallest non-zero edge weights.