Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2006: Algorithmic Aspects in Information and Management pp 243–254Cite as

Connected Set Cover Problem and Its Applications

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4041))

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.

This work was supported in part by the National Natural Science Foundation of China under Grant No. 70221001, 60373012 and 10531070.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Briers, A.: Incorporating connectivity into reserve selection procedures. Biological Conservation 14, 342–355 (2000)

    Article  Google Scholar 

  2. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  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 

  4. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256–278 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  5. Possingham, H., Ball, I., Andelman, S.: Mathematical methods for representative reserve networks. In: Ferson, S., Burgman, M. (eds.) Quantitative Methods for Conservation Biology, pp. 291–306. Springer, New York (2000)

    Chapter  Google Scholar 

  6. Ramaswami, R., Sasaki, G.: Multiwavelength optical networks with limited wavelength conversion. IEEE/ACM Transactions on Networking 6(6), 744–754 (1998)

    Article  Google Scholar 

  7. Ruan, L., Du, D.-Z., Hu, X.-D., Jia, X.-H., Li, D.-Y., Sun, Z.: Converter placement supporting broadcast in WDM networks. IEEE Transactions on Computers 50(7), 750–758 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Beijing University of Post and Telecom., Beijing, 100876, China

    Tian-Ping Shuai

  2. Institute of Applied Mathematics, Chinese Academy of Sciences, P. O. Box 2734, Beijing, 100080, China

    Xiao-Dong Hu

Authors
  1. Tian-Ping Shuai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Dong Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Clear Water Bay, Hong Kong University of Science and Technology, Hong Kong, China

    Siu-Wing Cheng

  2. Department of Computer Science, City University of Hong Kong,  

    Chung Keung Poon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/11775096_23

Download citation

  • DOI: https://doi.org/10.1007/11775096_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35157-3

  • Online ISBN: 978-3-540-35158-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation