Timeline for Maximize sum of edge weights on spanning tree
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15, 2021 at 7:23 | comment | added | Max David | But,I am not sure DCST can reduce to this problem | |
| Jan 14, 2021 at 20:50 | comment | added | Ben Barber | I'm glad I asked for clarification as I hadn't realised that DEG was degree in the spanning tree, although I'm not sure what else would have made sense. | |
| Jan 14, 2021 at 17:43 | comment | added | RobPratt | Hmm, I guess the linked problem is only a relaxation (degree at most $k$ rather than a specified degree sequence). | |
| Jan 14, 2021 at 16:48 | comment | added | Ben Barber | How do I code degree constrained spanning tree as in instance of this problem? | |
| Jan 14, 2021 at 14:59 | history | answered | RobPratt | CC BY-SA 4.0 |