Pages that link to "Item:Q5900079"
From MaRDI portal
The following pages link to Approximation algorithms and hardness results for the clique packing problem (Q5900079):
Displaying 6 items.
- The complexity of generalized clique packing (Q1073049) (← links)
- On the complexity of approximating \(k\)-set packing (Q2506163) (← links)
- Approximation Algorithms for the <i>k</i>-Clique Covering Problem (Q4895634) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
- The \(K_r\)-packing problem (Q5937570) (← links)