Timeline for Is this a satisfiability problem?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30 at 11:11 | comment | added | Daniel Weber | I don't understand your question | |
| Jul 30 at 7:47 | comment | added | Tetsuro Nakamura | > except one arbitrary one which is labelled with 1. The problem here does not limit the case to where there are only one ball labelled with 1 among the color. Even under that assumption, can it be said that it is the same as the set packing problem? | |
| Jul 27 at 15:29 | comment | added | Daniel Weber | When you have a small number of colors you can consider the vector of how many times each of the colors in the sets you choose to be filled appears, and then do DP on that | |
| Jul 27 at 13:16 | comment | added | Tetsuro Nakamura | Thank you for your clear answer. Do you have any ideas on what algorithms would work? | |
| Jul 26 at 10:43 | history | answered | Daniel Weber | CC BY-SA 4.0 |