The Minimum Vulnerability Problem

ALGORITHMS AND COMPUTATION, ISAAC 2012, pp. 382-391, 2012.

Cited by: 0|Bibtex|Views0

Abstract:

We revisit the problem of finding k paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the k paths. We provide a left perpendicular k/2 right perpendicular-approximation algorithm for this problem, improving the best previous approximation factor of k - 1...More

Code:

Data:

Your rating :
0

 

Tags
Comments