scientific article; zbMATH DE number 1261818
From MaRDI portal
Publication:4231921
zbMath0938.68915MaRDI QIDQ4231921
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
On the optimality of the random hyperplane rounding technique for MAX CUT ⋮ Approximability of maximum splitting of k-sets and some other Apx-complete problems ⋮ Semidefinite programming in combinatorial optimization ⋮ An approximation algorithm for scheduling two parallel machines with capacity constraints. ⋮ On the hardness of efficiently approximating maximal non-\(L\) submatrices. ⋮ Approximating the fixed linear crossing number ⋮ Semi-definite relaxation algorithm of multiple knapsack problem ⋮ Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment ⋮ On approximation of max-vertex-cover
This page was built for publication:
