Pages that link to "Item:Q5902134"
From MaRDI portal
The following pages link to Approximation algorithms and hardness results for the clique packing problem (Q5902134):
Displaying 15 items.
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- The three-dimensional stable roommates problem with additively separable preferences (Q2670931) (← 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)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
- The \(K_r\)-packing problem (Q5937570) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)
- On cluster editing problem with clusters of small sizes (Q6588757) (← links)
- On the parameterized complexity of compact set packing (Q6623598) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)