Connected set cover problem and its applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4041 LNCS, Issue , 2006, Pages 243-254

  Shuai, Tian Ping ^a   Hu, Xiao Dong ^b  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Approximation algorithm; Performance ratio; Set cover; Wavelength assignment

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; OPTICAL COMMUNICATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; PERFORMANCE RATIO; SET COVER; WAVELENGTH ASSIGNMENT;

SET THEORY;

EID: 33746218192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11775096_23     Document Type: Conference Paper

References (7)

1. A. Briers, Incorporating connectivity into reserve selection procedures, Biological Conservation, 14(2000) 342-355.
2. V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, 4(1979), 233-235.
3. U. Feige, A threshold of In n for aproximating set cover, Proc. 28th ACM Symposium on Theory of Computing, (1996), 314-318.
4. D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, 9(1974), 256-278.
5. H. Possingham, I. Ball and S. Andelman, Mathematical methods for representative reserve networks, In: S. Ferson and M.Burgman, eds., Quantitative Methods for Conservation Biology, Springer-Verlag, New York, (2000), 291-306.
6. R. Ramaswami and G. Sasaki, Multiwavelength optical networks with limited wavelength conversion, IEEE/ACM Transactions on Networking, 6(6)(1998), 744-754.
7. L. Ruan, D.-Z. Du, X.-D. Hu, X.-H. Jia, D.-Y. Li, and Z. Sun, Converter placement supporting broadcast in WDM networks, IEEE Transactions on Computers, 50 (7) (2001), 750-758.