Login / Signup

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

Till Tantau
Published in: STACS (2004)
Keyphrases
  • shortest path problem
  • small number
  • shortest path
  • directed graph
  • polynomial time approximation
  • computational complexity
  • graphical models
  • approximation algorithms
  • graph theoretic
  • approximation error