Timeline for Show that finding a minimum-weight subgraph that includes all marked nodes is NP-hard
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 20, 2014 at 22:48 | answer | added | InformedA | timeline score: 0 | |
| Nov 20, 2014 at 19:57 | answer | added | user3070752 | timeline score: 0 | |
| Nov 20, 2014 at 17:33 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Nov 20, 2014 at 17:32 | comment | added | Raphael | See our reference questions for general hints. If you want further help, please include what you have tried and where you did get stuck. | |
| Nov 20, 2014 at 14:07 | answer | added | David Richerby | timeline score: 2 | |
| Nov 20, 2014 at 14:04 | history | edited | David Richerby | CC BY-SA 3.0 |
tags
|
| Nov 20, 2014 at 13:14 | comment | added | Juho | One that works fairly easily is exact cover by 3 sets (X3C). | |
| Nov 20, 2014 at 12:19 | history | asked | user3070752 | CC BY-SA 3.0 |