A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.

Till Tantau

Browse the full STACS paper archive.