Pages that link to "Item:Q1765297"
From MaRDI portal
The following pages link to Approximating the dense set-cover problem (Q1765297):
Displaying 7 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)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection (Q5302422) (← links)