1-sensitive (3/2)-approximate ss-shortest paths

Approximate the single source shortest paths problem within a factor of 3/2 with a sensitivity of 1.

Parameters

  • VV: number of vertices
  • EE: number of edges
  • LL: maximum absolute value of edge cost

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table