Pages that link to "Item:Q3174693"

The following pages link to The Densest $k$-Subhypergraph Problem (Q3174693):

Displaying 17 items.

• The density maximization problem in graphs (Q386420) (← links)
• Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
• 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)
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
• Sharp detection boundaries on testing dense subhypergraph (Q2676927) (← links)
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
• Breaking the<i>r</i>_maxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
• Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
• PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)
• Pattern masking for dictionary matching: theory and practice (Q6547212) (← links)
• On approximating partial scenario set cover (Q6652422) (← links)
• Heterogeneous dense subhypergraph detection (Q6668604) (← links)