Pages that link to "Item:Q2840726"
From MaRDI portal
The following pages link to Approximating subdense instances of covering problems (Q2840726):
Displaying 7 items.
- On the approximability of dense Steiner problems (Q396661) (← 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)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- On covering approximation subspaces (Q2272265) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)