Timeline for Split sum into equal terms
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 22, 2011 at 2:01 | comment | added | Anadim | One different way of thinking this problem is the following. You have a full bipartite graph. The nodes on the left side represent your $l$ $r_l$ numbers and the vertices on your right represent your $t$ sets. The weights of the edge $e_{i,j}$ is the value $r_i$. Your objective now is to find something like a cardinality and weight "balanced" set cover comprising of $t$ sets. I'm not sure though if this can give you any further insights.. | |
Apr 22, 2011 at 0:54 | history | edited | arepo | CC BY-SA 3.0 |
added 19 characters in body
|
Apr 22, 2011 at 0:53 | comment | added | arepo | $t$ is specified | |
Apr 21, 2011 at 20:37 | comment | added | Brian Borchers | Is $t$ specified, or are you allowed to select $t$ as part of the optimization? | |
Apr 21, 2011 at 19:11 | answer | added | Seva | timeline score: 1 | |
Apr 21, 2011 at 18:39 | history | asked | arepo | CC BY-SA 3.0 |