Pages that link to "Item:Q4636436"

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

Displaying 8 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)
• The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
• PTAS for Densest k-Subgraph in Interval Graphs (Q5199279) (← links)
• The Maximum Exposure Problem. (Q5875471) (← links)