Timeline for Finding an instance of an n-element set cover
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2013 at 4:44 | history | tweeted | twitter.com/#!/StackCompSci/status/408819089671741440 | ||
| Nov 28, 2013 at 21:30 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |
formatting
|
| Nov 28, 2013 at 18:10 | comment | added | thad | @DavidRicherby I changed the numbering of the algorithm so that the parts of the while loop have the number 3 and a letter | |
| Nov 28, 2013 at 18:09 | history | edited | thad | CC BY-SA 3.0 |
Attempting to make the algorithm more decipherable
|
| Nov 26, 2013 at 17:08 | comment | added | David Richerby |
Please edit to make the algorithm unambiguous. For example, is line 6 a part of the while loop?
|
|
| Nov 26, 2013 at 9:27 | answer | added | Yuval Filmus | timeline score: 2 | |
| Nov 25, 2013 at 11:04 | comment | added | thad | @Subhayan I thought that's what they were asking for but now i think it's more of a statement about the algorithm they wanted me to edit. | |
| Nov 25, 2013 at 11:02 | comment | added | thad | @D.W. sorry for the confusion. My understanding of the problem wasnt thatvgreat to begin with. After some debate wiyh friends we've settled. On the idea thar they are asking for a set cover that has n elements in it. What really confused me about the question was that the last part about greedy set cover begin capable of returning an exponential amount of solutions. I wasn't sure why that was there. I'll that y to reorder and neaten everything up. | |
| Nov 24, 2013 at 9:01 | comment | added | Subhayan | you want the algo to run in exponential time?? | |
| Nov 24, 2013 at 5:45 | review | Close votes | |||
| Nov 28, 2013 at 21:27 | |||||
| Nov 24, 2013 at 5:28 | comment | added | D.W.♦ | I'm having a hard time understanding what you are asking. You are looking for an algorithm to... do what, exactly? What are the requirements? It's not clear what you are asking for. Are you asking for an exhaustive search algorithm to find the optimal set cover? (If so, the best way to do that is probably not to modify the algorithm you showed us, but rather to start from scratch.) Would this be clear to you, if you were reading it? I suggest you proofread the question and edit it to try to explain more clearly what you want to achieve and what you've already tried. | |
| Nov 24, 2013 at 0:08 | review | First posts | |||
| Nov 24, 2013 at 12:52 | |||||
| Nov 23, 2013 at 23:54 | history | edited | thad | CC BY-SA 3.0 |
My reasoning for the exponential running time
|
| Nov 23, 2013 at 23:48 | history | asked | thad | CC BY-SA 3.0 |