Timeline for Given $N$ integers on a circle, how to choose them in pairs to obtain minimum sum?
Current License: CC BY-SA 4.0
41 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27, 2019 at 18:18 | answer | added | Gerhard Paseman | timeline score: 0 | |
| Jul 27, 2019 at 12:40 | history | rollback | Todd Trimble |
Rollback to Revision 3
|
|
| Jul 27, 2019 at 12:38 | comment | added | Todd Trimble | I have undeleted this question because the contest ended several days ago. See discussion at meta here: meta.mathoverflow.net/questions/4292/… | |
| Jul 27, 2019 at 12:37 | history | undeleted | Todd Trimble | ||
| Jul 7, 2019 at 8:45 | history | deleted | Todd Trimble | via Vote | |
| Jul 7, 2019 at 8:40 | review | Close votes | |||
| Jul 7, 2019 at 8:50 | |||||
| Jul 7, 2019 at 8:24 | comment | added | Emil Jeřábek | I'm voting to close this question as off-topic because it is part of an ongoing contest. | |
| Jul 7, 2019 at 8:13 | comment | added | YCor | No rather go to the Meta post. | |
| Jul 7, 2019 at 8:12 | comment | added | user142757 | Let us continue this discussion in chat. | |
| Jul 7, 2019 at 8:12 | comment | added | user142757 | @YCor Don't know rules on mathoverflow but on stack exchange questions related to ongoing contest are removed(mostly) or made hidden. | |
| Jul 7, 2019 at 8:09 | comment | added | YCor | The question, title included, has been vandalized to hide the question. I'm not sure this is a good idea, and if ongoing contest is a valid deletion reason. (I previously edited by keeping the question with a visible warning mentioning and linking to the contest.) | |
| S Jul 7, 2019 at 8:04 | history | suggested | user142757 | CC BY-SA 4.0 |
added one link
|
| Jul 7, 2019 at 8:04 | review | Suggested edits | |||
| S Jul 7, 2019 at 8:04 | |||||
| Jul 7, 2019 at 8:03 | comment | added | user142757 | @YCor Do you know the moderator ? | |
| S Jul 7, 2019 at 7:58 | history | suggested | user142757 | CC BY-SA 4.0 |
Problem is from contest
|
| Jul 7, 2019 at 7:58 | review | Suggested edits | |||
| S Jul 7, 2019 at 7:58 | |||||
| Jul 7, 2019 at 7:55 | history | edited | YCor | CC BY-SA 4.0 |
mentioned contest
|
| Jul 7, 2019 at 7:53 | comment | added | user142757 | @YCor Contest is going on probably. | |
| Jul 7, 2019 at 7:52 | comment | added | YCor | @Glator thanks for mentioning (I don't think this was addressed particularly to me). I'll edit the post to make it visible that it's part of a contest. However I don't think this is a closure reason (some people may want to discuss it here, notably when the contest is closed.) | |
| Jul 7, 2019 at 7:45 | comment | added | user142757 | @YCor Don't know from where OP got the question i guess it is similar to a online contest going codechef.com/JULY19A/problems/CIRMERGE | |
| Jul 7, 2019 at 7:40 | comment | added | YCor | @JohnOmielan I think it's better concentrate all this extra discussion to the meta post. | |
| Jul 7, 2019 at 7:25 | comment | added | John Omielan | @YCor As I stated on Meta, I'm not sure why that post says "for reasons of moderation" if it was self-deleted, and I'm sorry for any hassle or trouble I might have caused. | |
| Jul 7, 2019 at 6:43 | comment | added | YCor | As Martin Sleziak said on Meta, the MSE post was also deleted by the OP. | |
| Jul 6, 2019 at 21:19 | comment | added | Gerhard Paseman | Where does this problem come from? Gerhard "Interview, Challenge, Contest, Or Homework?" Paseman, 2019.07.06. | |
| Jul 6, 2019 at 20:56 | comment | added | YCor | Related meta discussion on previous deletion of this question by OP. | |
| Jul 6, 2019 at 20:55 | history | edited | YCor | CC BY-SA 4.0 |
formatting, added tag
|
| Jul 6, 2019 at 20:44 | answer | added | Mehtaab Sawhney | timeline score: 0 | |
| Jul 6, 2019 at 19:55 | history | undeleted |
YCor Jeremy Rickard Francois Ziegler |
||
| Jul 6, 2019 at 14:19 | history | deleted | user142755 | via Vote | |
| Jul 6, 2019 at 12:11 | comment | added | user142755 | @turbo One of the way i tried to optimise is to select only that pair such that step after it gives more optimisation compared to choosing other pair | |
| Jul 6, 2019 at 12:07 | comment | added | user142755 | @Turbo can you explain your second approach | |
| Jul 6, 2019 at 12:02 | comment | added | user142755 | @turbo your first approach is similar to answer .It fails for many sequences .One example i have provided as comment in answer (when there are more than one pair whose some is equal). | |
| Jul 6, 2019 at 12:00 | comment | added | user142755 | @Turbo can you explain your comment in an answer and elaborate it little .May be i am tired of trying various approaches | |
| Jul 6, 2019 at 11:55 | comment | added | user142755 | @Turbo The answer given in answer section is wrong and not in comments | |
| Jul 6, 2019 at 11:54 | comment | added | Turbo | Ok leetcode possible then? Whose answer is incorrect? | |
| Jul 6, 2019 at 11:52 | comment | added | Turbo | There may be cleverer way to optimize. Second solution is at step $i$ you pick all even or all odd indices or you pick one edge and go to step $i+1$ with minimum of the three possibilities in mind and that may simplify things. | |
| Jul 6, 2019 at 11:43 | comment | added | user142755 | @Turbo No.Also the answer provided is not correct . | |
| Jul 6, 2019 at 11:42 | comment | added | Turbo | Looks like dynamic programming problem in assignments. $$W(\{t_1,\dots,t_n\})=\min_{i\in\{1,\dots,n\}}w_{i,i+1} + W(\{t_1,\dots,t_n\}\backslash\{t_i,t_j\})$$ seems to be the general recursion where $W(\mathcal T)$ is minimum weight over all members of the set $\mathcal T$ and $w_{i,i+1}=A_i+A_{i+1}$ and you need to relabel the set entries. | |
| Jul 6, 2019 at 11:03 | answer | added | Manfred Weis | timeline score: 2 | |
| Jul 6, 2019 at 8:45 | review | First posts | |||
| Jul 6, 2019 at 9:27 | |||||
| Jul 6, 2019 at 8:44 | history | asked | user142755 | CC BY-SA 4.0 |