Pages that link to "Item:Q1924486"

The following pages link to On a theorem of Lovász on covers in \(r\)-partite hypergraphs (Q1924486):

Displaying 10 items.

• Approximating vertex cover in dense hypergraphs (Q450531) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
• Independence-domination duality (Q958688) (← links)
• On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
• Approximation algorithms for hitting subgraphs (Q2115875) (← links)
• Hypergraph representation via axis-aligned point-subspace cover (Q2154113) (← links)
• Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
• Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
• Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)