Connected Set Cover Problem and Its Applications

  • Tian-Ping Shuai
  • Xiao-Dong Hu
Conference paper

DOI: 10.1007/11775096_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)
Cite this paper as:
Shuai TP., Hu XD. (2006) Connected Set Cover Problem and Its Applications. In: Cheng SW., Poon C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg


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.


Set cover Approximation algorithm Performance ratio Wavelength assignment 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tian-Ping Shuai
    • 1
  • Xiao-Dong Hu
    • 2
  1. 1.Department of MathematicsBeijing University of Post and Telecom.BeijingChina
  2. 2.Institute of Applied MathematicsChinese Academy of SciencesBeijingChina

Personalised recommendations