In network and graph class, we learn that there is no finite worst case bound for TSP. But I thought there is no finite worst case bound for any NP complete problem. Because of this wrong understanding, I argued with a speaker during Informs about his speech about bound of one multi-echolen problem. Of course, he cannot agree on my wrong opinion.
I realize this understand is wrong until today when I happen to read the bounds on Bin-Packing problem.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment