Connected set cover problem and its applications

Authors:
Tian-Ping Shuai;Xiao-Dong Hu
Affiliations:
Department of Mathematics, Beijing University of Post and Telecom., Beijing, China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 4
Cited 6

A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multiwavelength optical networks with limited wavelength conversion

IEEE/ACM Transactions on Networking (TON)
Converter Placement Supporting Broadcast in WDM Optical Networks

IEEE Transactions on Computers
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Improved Approximation Algorithms for Relay Placement

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithms for connected set cover problem and fault-tolerant connected set cover problem

Theoretical Computer Science
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Detecting disease-specific dysregulated pathways via analysis of clinical expression profiles

RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Algorithms for detecting significantly mutated pathways in cancer

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Note: The relation of Connected Set Cover and Group Steiner Tree

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.