Pages that link to "Item:Q261389"
From MaRDI portal
The following pages link to PTAS for densest \(k\)-subgraph in interval graphs (Q261389):
Displaying 5 items.
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Graph classes and approximability of the happy set problem (Q2019476) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
