Timeline for $ n $-Cats-in-a-Bed Problem: Picking $ n $ points in a given planar domain to maximize the sum of their pairwise distances
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2015 at 12:02 | comment | added | Roland Bacher | I love the title which suggests an obvious near-solution: put $n$ unfriendly cats in room of shape $C$. | |
| Feb 24, 2015 at 0:41 | comment | added | Marty | In the case n=2, a Google image search indicates that pairs of cats in a bed tend not to maximize their pairwise distance. This may be a case of sampling bias however. | |
| Feb 23, 2015 at 10:14 | comment | added | Marty | When $n=1$, the solution can be found at sleepingcatsw.com/images/cats/luther_bed.jpg | |
| S Feb 23, 2015 at 5:22 | history | suggested | Transcendental | CC BY-SA 3.0 |
Improved title and formatting.
|
| Feb 23, 2015 at 4:30 | review | Suggested edits | |||
| S Feb 23, 2015 at 5:22 | |||||
| Feb 23, 2015 at 4:30 | history | edited | Christian Remling | CC BY-SA 3.0 |
deleted 10 characters in body
|
| Feb 23, 2015 at 1:10 | comment | added | Joseph O'Rourke | I don't think your question is easily answered. Here's an old paper on the topic: "On the sum of distances determined by a pointset"; Acta Mathematica Academiae Scientiarum Hungarica, Volume 7, Issue 3-4, pp 397-401. (Springer link) | |
| Feb 23, 2015 at 1:06 | comment | added | Boris Bukh | The question is unclear: how is the domain given in the input? How efficient you want your algorithm be (exact? approximate in some sense?). Also, what do you already know? | |
| Feb 23, 2015 at 0:59 | review | First posts | |||
| Feb 23, 2015 at 1:11 | |||||
| Feb 23, 2015 at 0:56 | history | asked | Andy Ludu | CC BY-SA 3.0 |
