Connected Set Cover Problem and Its Applications
We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity constraint. We first propose two algorithms that find optimal solutions for two cases, respectively, and then we propose one approximation algorithm for a special case that has the best possible performance ratio. At last we consider how to apply the obtained result to solve a wavelength assignment problem in all optical networks.
KeywordsSet cover Approximation algorithm Performance ratio Wavelength assignment
Unable to display preview. Download preview PDF.
- 3.Feige, U.: A threshold of ln n for aproximating set cover. In: Proc. 28th ACM Symposium on Theory of Computing, pp. 314–318 (1996)Google Scholar