Pages that link to "Item:Q1683124"

The following pages link to Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124):

Displaying 11 items.

• A note on the approximability of the dense subgraph problem. (Q1776068) (← links)
• Graph classes and approximability of the happy set problem (Q2019476) (← links)
• Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
• The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
• A deterministic approximation algorithm for the densest \(k\)-subgraph problem (Q2427738) (← links)
• Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
• Complexity and approximability of the happy set problem (Q2662689) (← links)
• Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph (Q4978037) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• The dense \(k\)-subgraph problem (Q5930156) (← links)