HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

The Minimum Vulnerability Problem

Sepehr Assadi
Sepehr Assadi
Ehsan Emamjomeh-Zadeh
Ehsan Emamjomeh-Zadeh
Ashkan Norouzi-Fard
Ashkan Norouzi-Fard
Sadra Yazdanbod
Sadra Yazdanbod
Hamid Zarrabi-Zadeh
Hamid Zarrabi-Zadeh

international symposium on algorithms and computation, Volume 70, Issue 4, 2014, Pages 718-731.

Cited by: 18|Bibtex|Views47|DOI:https://doi.org/10.1007/978-3-642-35261-4_41
EI
Other Links: dblp.uni-trier.de|dl.acm.org|link.springer.com|academic.microsoft.com
Keywords:
Network designShared edgesApproximation algorithmsInapproximability

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments