Pages that link to "Item:Q3174693"
From MaRDI portal
The following pages link to The Densest $k$-Subhypergraph Problem (Q3174693):
Displaying 7 items.
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- The maximum exposure problem (Q2123293) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- Sharp detection boundaries on testing dense subhypergraph (Q2676927) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)