Timeline for Generating sets of tuples from possible candidate lists (or finding perfect matchings in uniform hypergraphs)
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2011 at 17:35 | vote | accept | user14473 | ||
| Apr 18, 2011 at 5:51 | comment | added | Gerry Myerson | No one has voted to close, so it doesn't look like there's any problem with posting here. I just thought a programming website might be a better fit, depending on just exactly what you were interested in. | |
| Apr 18, 2011 at 5:40 | history | edited | user14473 | CC BY-SA 3.0 |
added 341 characters in body; edited title
|
| Apr 18, 2011 at 5:36 | vote | accept | user14473 | ||
| Apr 18, 2011 at 5:38 | |||||
| Apr 18, 2011 at 4:31 | history | edited | user14473 | CC BY-SA 3.0 |
added 71 characters in body
|
| Apr 18, 2011 at 4:14 | answer | added | Aaron Meyerowitz | timeline score: 2 | |
| Apr 18, 2011 at 2:44 | comment | added | user14473 | Thanks, I'll look into system of distinct representatives. I was considering whether to ask it here. Does it fall into 'what not to ask here' because it's too localized?. Maybe a better wording of the question would have been 'does this look like it's equivalent to some [matching, flow, something] problem, and could you point me in that direction'. Where should I ask this question? Are you referring to one of the homework help sites? I considered stackoverflow, but I decided against it since I wasn't talking about programming it in any specific language. | |
| Apr 17, 2011 at 23:34 | comment | added | Gerry Myerson | It sounds a little bit like you are looking for a "system of distinct representatives," perhaps you could search on that term. But if you really want an algorithm, there are sites where that kind of question fits better. Please see the faq. | |
| Apr 17, 2011 at 23:11 | history | asked | user14473 | CC BY-SA 3.0 |