Timeline for (How) do Better TSP Heuristics help in Answering the $NP=P$ Question?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2017 at 11:58 | comment | added | Manfred Weis | I just found the article Scalefree hardness of average-case Euclidean TSP approximation by Alan Frieze and Wesley Pegden, in which further limitations on the usability of heuristics are proven. | |
| Dec 20, 2017 at 3:04 | answer | added | Timothy Chow | timeline score: 3 | |
| Dec 20, 2017 at 0:23 | answer | added | John Gunnar Carlsson | timeline score: 4 | |
| Dec 19, 2017 at 21:31 | history | asked | Manfred Weis | CC BY-SA 3.0 |