Pages that link to "Item:Q1779691"
From MaRDI portal
The following pages link to On approximation of the vertex cover problem in hypergraphs (Q1779691):
Displayed 8 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- On the vertex cover number of 3-uniform hypergraph (Q2240114) (← links)
- Minimal covers of infinite hypergraphs (Q2324493) (← links)
- From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
- On the construction of a set of fundamental physical constants of unit and zero dimensions (Q6195382) (← links)