And then we will able to show that the minimum partition is not solvable in polynomial time. But still some remain open
Moreover we will able to show that the graph colouring is not in PTAS, but is this problem in APX
| We will be
able to say that minimum travelling are not approxible packing and are approximable
and then we will able to show that And then we will able to show that the minimum partition is not solvable in polynomial time. But still some remain open Moreover we will able to show that the graph colouring is not in PTAS, but is this problem in APX |
|
