A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

@inproceedings{Boros2009AFA,
  title={A Fast and Simple Parallel Algorithm for the Monotone Duality Problem},
  author={Endre Boros and Kazuhisa Makino},
  booktitle={ICALP},
  year={2009}
}
We consider a hypergraph F and the problem of generating the family of its minimal transversals G = F . In the corresponding decision problem we given two hypergraphs, F and G, which is a subfamily = F , and we have to recognize if G = F , or produce an edge T belonging to F −G. These are long standing challenging problems, the complexity of which is not known. The first non-exponential algorithm is by Fredman and Khachiyan (1996) solves the decision problem in O(N logN/ log ), where N = |F… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.