The following pages link to (Q5365139):
Displayed 7 items.
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- PTAS for Sparse General-valued CSPs (Q6075749) (← links)