On approximation of the vertex cover problem in hypergraphs

Recommendations

Publication:4952635
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
An approximation algorithm for the partial vertex cover problem in hypergraphs
Approximating vertex cover in dense hypergraphs

Cites work

A Greedy Heuristic for the Set-Covering Problem
A Tight Analysis of the Greedy Algorithm for Set Cover
Approximate Set Covering in Uniform Hypergraphs
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
Improved lower bounds on k‐independence
Matchings and covers in hypergraphs
On a theorem of Lovász on covers in $r$-partite hypergraphs

Cited in

(28)

Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
On the vertex cover number of 3-uniform hypergraph
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Randomized approximation for the set multicover problem in hypergraphs
An approximation algorithm for submodular hitting set problem with linear penalties
Minimal covers of infinite hypergraphs
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
A randomised approximation algorithm for the hitting set problem
Approximation of Self-stabilizing Vertex Cover Less Than 2
Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs
An approximation algorithm for the partial vertex cover problem in hypergraphs
Approximability of the vertex cover problem in power-law graphs
scientific article; zbMATH DE number 1445320 (Why is no real title available?)
Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
Complete-subgraph-transversal-sets problem on bounded treewidth graphs
Approximating vertex cover on dense graphs
On the construction of a set of fundamental physical constants of unit and zero dimensions
From causes for database queries to repairs and model-based diagnosis and back
On hard instances of approximate vertex cover
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
A list heuristic for vertex cover
Solving vertex cover in polynomial time on hyperbolic random graphs
Approximate Set Covering in Uniform Hypergraphs
Solving vertex cover in polynomial time on hyperbolic random graphs
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Approximating vertex cover in dense hypergraphs

This page was built for publication: On approximation of the vertex cover problem in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779691)