Pages that link to "Item:Q2448865"
From MaRDI portal
The following pages link to Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865):
Displaying 4 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)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Complexity and approximability of the happy set problem (Q2662689) (← links)