Pages that link to "Item:Q4575795"
From MaRDI portal
The following pages link to Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion (Q4575795):
Displaying 10 items.
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- The maximum exposure problem (Q2123293) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- (Q5009502) (← links)
- (Q5091190) (← links)
- The Maximum Exposure Problem. (Q5875471) (← links)