Timeline for sorting two paired lists of real numbers to minimize consecutive absolute differences
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 24, 2013 at 5:44 | vote | accept | R Hahn | ||
Jan 23, 2013 at 21:47 | answer | added | Erick Wong | timeline score: 6 | |
Jan 23, 2013 at 20:34 | answer | added | Gerhard Paseman | timeline score: 1 | |
Jan 23, 2013 at 18:21 | comment | added | R Hahn | Yeah, I just remembered that the last time I thought about this I realized it could be formulated as a traveling salesman type problem. I need to go look at algorithms tailored to the version in the plane. | |
Jan 23, 2013 at 18:19 | history | undeleted | R Hahn | ||
Jan 23, 2013 at 18:19 | history | deleted | R Hahn | ||
Jan 23, 2013 at 18:19 | comment | added | Anthony Quas | This sounds like you want a Hamiltonian path in the $L^1$ metric on $\R^2$ of shortest length. | |
Jan 23, 2013 at 16:55 | history | asked | R Hahn | CC BY-SA 3.0 |