See this document in CiteSeerX!

Exact Algorithms for Finding Minimum Transversals in Rank-3 Hypergraphs (2003)  (Make Corrections)  
Magnus Wahlström



  Home/Search   Context   Related

 
View or download:
ida.liu.se/~magwa/research/hyptr.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ida.liu.se/~magwa/publications (more)
Homepages:  M.Wahlstrom  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present two algorithms for the problem of finding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem... (Update)

Active bibliography (related documents):   More   All
0.2:   Testing Hypergraph Coloring - Czumaj, Sohler (2001)   (Correct)
0.2:   Maximum Agreement and Compatible Supertrees RR-LIRMM 04045 - Vincent Berry And   (Correct)
0.2:   Maximum Agreement and Compatible Supertrees - Rr-Lirmm Vincent Berry   (Correct)

Similar documents based on text:   More   All
0.2:   Counting Satisfying Assignments in 2-SAT and 3-SAT - Dahllöf, Jonsson, Wahlström   (Correct)
0.1:   Progress in Geometric Transversal Theory - Wenger (2001)   (Correct)
0.1:   Transversals to line segments in R³ - Brönnimann, Everett, Lazard..   (Correct)

BibTeX entry:   (Update)

@misc{ wahlstrom-exact,
  author = "Magnus Wahlstr{\"o}m",
  title = "Exact Algorithms for Finding Minimum Transversals in Rank-3 Hypergraphs",
  url = "citeseer.ist.psu.edu/716076.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
134   Concrete mathematics: a foundation for computer science (context) - Graham, Knuth et al. - 1994
113   North Holland (context) - Berge - 1989
69   the complexity of dualization of monotone disjunctive normal.. (context) - Fredman, Khachiyan - 1996
67   Identifying the minimal transversals of a hypergraph and rel.. - Eiter, Gottlob - 1995
49   Algorithms for maximum independent sets (context) - Robson - 1986
48   Parameterized complexity: A framework for systematically con.. - Downey, Fellows et al. - 1999
35   New methods for 3-sat decision and worst-case analysis - Kullmann - 1999
34   and machine learning (context) - Gunopulos, Mannila et al. - 1997
10   Extensions of a theorem of Moon and Moser on complete subgra.. (context) - de Caen - 1983
6   Generating all maximal independent sets of bounded-degree hy.. (context) - Mishra, Pitt - 1997
6   Evaluation of an algorithm for the transversal hypergraph pr.. - Kavvadias, Stavropoulos - 1999
4   An efficient fixed parameter algorithm for 3-hitting set - Niedermeier, Rossmanith - 2003
4   Approximating coloring and maximum independent sets in 3-uni.. - Krivelevich, Nathaniel et al. - 2001

Documents on the same site (http://www.ida.liu.se/~magwa/publications.html):
Counting Models for 2SAT and 3SAT Formulae - Dahllöf, Jonsson, Wahlström   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC