Timeline for Maximum set cover with non-overlap
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 27 at 11:46 | comment | added | ConnFus | In set cover, we want the minimum size, i.e. at most $k$. Also in the second paragraph, your last sentence is cut off. | |
| Jul 27 at 6:48 | comment | added | codeR | Also, @math-jl has posted a link (see above) where a hardness proof is given using a reduction from the SAT. | |
| Jul 27 at 6:47 | comment | added | codeR | The idea is an inspiration from a similar problem given here. | |
| Jul 27 at 6:42 | history | answered | codeR | CC BY-SA 4.0 |