2-sensitive (7/5)-approximate st-shortest paths
Approximate the st-shortest paths problem within a factor of 7/5 with a sensitivity of 2.
Parameters
- : number of vertices
- : number of edges
- : maximum absolute value of edge cost
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