Average case analysis of a greedy algorithm for the minimum hitting set problem

  • W. Fernandez de la Vega
  • V. Th. Paschos
  • R. Saad
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 583)

Abstract

Let k be fixed. Let n and m denote integers and C = {C1,...,Cm} a family of m subsets drawn from an n-element set C. A subset H\(\subseteq\)C is a hitting set for the family C if H has a non-empty intersection with each element of this family and the minimum hitting set problem is that of finding a hitting set of minimum cardinality. The purpose of this paper is to study the efficiency of a natural greedy algorithm for the approximate solution of the minimum hitting set probl em when C is a random family of k-element subsets, k fixed, and when n and m tend to ∞ with \(\tfrac{m}{n}\)= α, a fixed constant.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T. G. Kurtz, Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes, J. Appl. Prob. 7, pp. 49–58, 1970.Google Scholar
  2. [2]
    M. Garey and D. Johnson, Computers and Intractability — A Guide to the Theory of NP-Completeness, (Freeman, New York, 1979).Google Scholar
  3. [3]
    J. F. Gimpel, A Stochastic Approach to the Solution of Large Covering Problems, IEEE Switching and Automata Theory, pp. 76–83, 1967.Google Scholar
  4. [4]
    R. M. Karp, The Probabilistic Analysis of Some Combinatorial Search Algorithms, in J. F. Traub (ed.), Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York, pp. 1–19, 1976.Google Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • W. Fernandez de la Vega
    • 1
  • V. Th. Paschos
    • 1
    • 2
  • R. Saad
    • 1
  1. 1.Université de Paris-XIOrsay CedexFrance
  2. 2.CERMSEM, Université de Paris I-SorbonneParisFrance

Personalised recommendations