Skip to main content
SpringerLink
Log in

Parallel and serial heuristics for the minimum set cover problem

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics. These heuristics show considerable speedup when the number of processors is increased. The quality of the solution computed by the heuristics does not degrade with an increase in the number of processors.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Berger, B., Rompel, J., and Shor, P.W. 1989. Efficient NC algorithms for set cover with applications to learning and geometry. IEEE Symp. FOCS, pp. 54–59.

  • Chakravarty, S., Hunt III, H.B., Rosenkrantz, J., and Ravi, S.S. 1989. Complexity of generating minimum test sets for PLAs and monotone combinatorial circuits. IEEE Trans. Comps., 38, 6 (June), 865–869.

    Google Scholar 

  • Chvatal, V. 1979. A greedy heuristic for the set-covering problem. Math. Op. Res., 4, 3 (Aug.), 233–235.

    Google Scholar 

  • Cole, R.J. 1988. Parallel merge sort. SIAM J. Computing, 17, 4 (Aug.), 770–785.

    Google Scholar 

  • Johnson, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comp. and Sys. Sci., 9: 256–278.

    Google Scholar 

  • Johnson, D.S., and Garey, G. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.

    Google Scholar 

  • Lovasz, L. 1975. On the ratio of optimal integral and fractional covers. Discrete Math., 13: 383–390.

    Google Scholar 

  • Schneck, P. 1986. Superlinear speedup and the halting problem. Software—Practice and Experience, 16, 8 (Aug.), 781–782.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Buffalo, 14260, Buffalo, NY, USA

    Sreejit Chakravarty & Ajay Shekhawat

Authors
  1. Sreejit Chakravarty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ajay Shekhawat
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research of both authors was supported by NSF Grant No. MIP-8807540.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chakravarty, S., Shekhawat, A. Parallel and serial heuristics for the minimum set cover problem. J Supercomput 5, 331–345 (1992). https://doi.org/10.1007/BF00127952

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00127952

Keywords

Search

Navigation