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

DOI: 10.1007/BFb0023824

Part of the Lecture Notes in Computer Science book series (LNCS, volume 583)
Cite this paper as:
Fernandez de la Vega W., Paschos V.T., Saad R. (1992) Average case analysis of a greedy algorithm for the minimum hitting set problem. In: Simon I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg

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.

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