Delete comment from: Computational Complexity
To Anonymous 25
Yes, I am totally aware of the restrictions of the other problems I cite. For makespan minimization on unrelated parallel machines, the author gives a proof of a better than 2 integrality gap for a configuration LP for the restricted version, not an algorthm. But that was not my point. My point was that like this result, those were also equally interesting results.
Dec 22, 2010, 11:41:04 AM
Posted to BREAKTHROUGH in algorithms: Improved algorithm for Metric TSP!!!!!!!!