The Minimum Vulnerability Problem
international symposium on algorithms and computation, Volume 70, Issue 4, 2014, Pages 718-731.
Network designShared edgesApproximation algorithmsInapproximability
We revisit the problem of finding paths with a minimum number of shared edges between two vertices of a graph. An edge is called if it is used in more than one of the paths. We provide a -approximation algorithm for this problem, improving the best previous approximation factor of . We also provide the first approximation algorithm for...More
PPT (Upload PPT)