The following pages link to (Q4231921):
Displaying 9 items.
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On the hardness of efficiently approximating maximal non-\(L\) submatrices. (Q1418978) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment (Q2773169) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
