Pages that link to "Item:Q1733046"
From MaRDI portal
The following pages link to A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046):
Displaying 4 items.
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Faster Algorithms to Enumerate Hypergraph Transversals (Q2802949) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)