The Minimum Vulnerability Problem

@article{Assadi2014TheMV,
  title={The Minimum Vulnerability Problem},
  author={Sepehr Assadi and Ehsan Emamjomeh-Zadeh and Ashkan Norouzi-Fard and Sadra Yazdanbod and Hamid Zarrabi-Zadeh},
  journal={Algorithmica},
  year={2014},
  volume={70},
  pages={718-731}
}
We revisit the problem of finding $$k$$ 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$$ k paths. We provide a $${\lfloor {k/2}\rfloor }$$ ⌊ k / 2 ⌋ -approximation algorithm for this problem, improving the best previous approximation factor of $$k-1$$ k - 1 . We also provide the first approximation algorithm for the problem with a sublinear approximation factor of $$O(n^{3/4})$$ O ( n 3 / 4… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Minimum cost paths subject to minimum vulnerability for reliable communications

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05) • 2005
View 2 Excerpts

Similar Papers

Loading similar papers…