Pages that link to "Item:Q1765297"
From MaRDI portal
The following pages link to Approximating the dense set-cover problem (Q1765297):
Displaying 17 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)
- Optimization through dense sets (Q511318) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem (Q2446594) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- A note on the set union knapsack problem (Q2449074) (← links)
- Approximating subdense instances of covering problems (Q2840726) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- A threshold of ln <i>n</i> for approximating set cover (Q3158517) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa (Q4831416) (← links)
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513) (← links)
- CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection (Q5302422) (← links)
- Benchmark data set with service programs to approximately solve the set covering problem (Q5756398) (← links)
- Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
