Pages that link to "Item:Q3149886"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs (Q3149886):
Displaying 47 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- The ordered covering problem (Q722532) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Models of greedy algorithms for graph problems (Q834580) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Reconstruction of Kauffman networks applying trees (Q2497958) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs (Q3088179) (← links)
- (Q3455032) (← links)
- Combinatorial Auctions with Conflict-Based Externalities (Q3460791) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5075740) (← links)
- The Approximability of Assortment Optimization Under Ranking Preferences (Q5131544) (← links)
- Algorithms and Computation (Q5191683) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
