Pages that link to "Item:Q1960657"

The following pages link to Improved non-approximability results for minimum vertex cover with density constraints (Q1960657):

Displaying 10 items.

• Approximating vertex cover in dense hypergraphs (Q450531) (← links)
• Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
• On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
• Approximating edge dominating set in dense graphs (Q764308) (← links)
• Models of greedy algorithms for graph problems (Q834580) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
• Approximation hardness of edge dominating set problems (Q2369972) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)