Timeline for Algorithm to minimize $\operatorname{tr}(PAP^TB)$?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 13, 2022 at 20:47 | comment | added | Chase Roberts | Oh no! I was afraid this was the case. Your proof is very elegant so I can’t even argue with it. My only criticism is that my question was about minimizing not maximizing, but your general proof would still work in the minimizing case if you set $A$ equal to 1 - (n adjacency matrix) instead | |
| Feb 13, 2022 at 20:44 | vote | accept | Chase Roberts | ||
| Feb 13, 2022 at 9:55 | history | edited | LeechLattice | CC BY-SA 4.0 |
added 145 characters in body
|
| Feb 13, 2022 at 9:49 | history | answered | LeechLattice | CC BY-SA 4.0 |