Skip to main content
SpringerLink
Log in

Evaluation of an Algorithm for the Transversal Hypergraph Problem

  • Conference paper
  • First Online:
Algorithm Engineering (WAE 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1668))

Included in the following conference series:

Abstract

The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the given one. This problem turns out to be central in various fields of Computer Science. We present and experimentally evaluate a heuristic algorithm for the problem, which seems able to handle large instances and also possesses some nice features especially desirable in problems with large output such as the Transversal Hypergraph Problem.

Research supported by the University of Patras Research Committee (Project Caratheodory under contract no.1939).

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ben-Eliyahu and R. Dechter. On computing minimal models. Annals of Mathematics and Artificial Inteligence, 18:3–27, 1996.

    Article  MathSciNet  Google Scholar 

  2. C. Berge. Hypergraphs, volume 45 of North Holland Mathematical Library. Elsevier Science Publishers B.V., Amsterdam, 1989.

    Google Scholar 

  3. M. Cadoli. The complexity of model checking for circumscriptive formulae. Information Processing Letters, 42:113–118, 1992.

    Article  MathSciNet  Google Scholar 

  4. Z. Chen and S. Toda. The complexity of selecting maximal solutions. Information and Computation, 119:231–239, 1995.

    Article  MathSciNet  Google Scholar 

  5. J. de Kleer, A. K. Mackworth, and R. Reiter. Characterising diagnosis and systems. Artificial Intelligence, 56:197–222, 1992.

    Article  MathSciNet  Google Scholar 

  6. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Computing, 24(6):1278–1304, December, 1995.

    Article  MathSciNet  Google Scholar 

  7. M. L. Fredman and L. Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21:618–628, 1996.

    Article  MathSciNet  Google Scholar 

  8. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. Journal of ACM, 32(4):841–860, 1985.

    Article  MathSciNet  Google Scholar 

  9. D. Gunopulos, R. Khardon, H. Mannila, and H. Toinonen. Data mining, hypergraph transversals, and machine learning. In Proc. of Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 209–216, Tucson, Arizona, USA, May 12-14, 1997.

    Google Scholar 

  10. V. Gurvich and L. Khachiyan. Generating the irredundent conjunctive and disjunctive normal forms of monotone Boolean functions. Technical Report LCSR-TR-251, Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, 1995.

    Google Scholar 

  11. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119–123, 1988.

    Article  MathSciNet  Google Scholar 

  12. D. Kavvadias and M. Sideri. The inverse satisfiability problem. SIAM J. Computing, 28(1):152–163, 1999.

    Article  MathSciNet  Google Scholar 

  13. D. J. Kavvadias, M. Sideri, and E. C. Stavropoulos. Generating all maximal models of a Boolean expression. Submitted.

    Google Scholar 

  14. D. J. Kavvadias and E. C. Stavropoulos. A new algorithm for the transversal hypergraph problem. Technical Report CTI TR 99.03.03, Computer Technology Institute, Patras, Greece, March 1999.

    MATH  Google Scholar 

  15. H. Mannila and K. J. Räihä. Design by example: An application of Armstrong relations. Journal of Computer and System Sciences, 32(2):126–141,1986.

    Article  MathSciNet  Google Scholar 

  16. H. Mannila and K. J. Räihä. Algorithms for inferring functional dependencies. Data & Knowledge Engineering, 12(1):83–99, February, 1994.

    Article  Google Scholar 

  17. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Technical Report C-1997-8, Department of Computer Science, University of Helsinki, Finland, 1997.

    Google Scholar 

  18. J. McCarthy. Cirmumscription-a form of nonmonotonic reasoning. Artificial Inteligence, 13:27–39, 1980.

    Article  Google Scholar 

  19. C. H. Papadimitriou. NP-completeness: A retrospective. In Proc. of ICALP 98, Bologna, Italy, 1998.

    Google Scholar 

  20. B. Selman and H. K. Kautz. Model preference default theories. Artificial Inteligence, 45:287–322, 1990.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Patras, GR-265 00, Patras, Greece

    Dimitris J. Kavvadias

  2. Computer Engineering & Informatics Department, University of Patras, GR-265 00, Patras, Greece

    Elias C. Stavropoulos

Authors
  1. Dimitris J. Kavvadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elias C. Stavropoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Duke University, Box 90129, Durham, NC, 27708-0129, USA

    Jeffrey S. Vitter

  2. Department of Computer Science, University of London, King’s College, Strand, London, WC2R 2LS, UK

    Christos D. Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kavvadias, D.J., Stavropoulos, E.C. (1999). Evaluation of an Algorithm for the Transversal Hypergraph Problem. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48318-7_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66427-7

  • Online ISBN: 978-3-540-48318-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation