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 7 items.
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← 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)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- On the parameterized complexity of compact set packing (Q6091178) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
