Pages that link to "Item:Q1779691"
From MaRDI portal
The following pages link to On approximation of the vertex cover problem in hypergraphs (Q1779691):
Displaying 25 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← 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)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Minimal covers of infinite hypergraphs (Q2324493) (← links)
- From causes for database queries to repairs and model-based diagnosis and back (Q2402617) (← links)
- A list heuristic for vertex cover (Q2643795) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Approximating vertex cover on dense graphs (Q2921716) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation (Q3467859) (← links)
- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications (Q3558909) (← links)
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391) (← links)
- Approximate Set Covering in Uniform Hypergraphs (Q4366877) (← links)
- On hard instances of approximate vertex cover (Q4962765) (← links)
- Approximation of Self-stabilizing Vertex Cover Less Than 2 (Q5307040) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- On the construction of a set of fundamental physical constants of unit and zero dimensions (Q6195382) (← links)
