Timeline for Non-convex optimization problem involving minimum spanning trees
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2016 at 20:24 | comment | added | Tom Solberg | Let's say the former (vertices $x_j$), to improve whatever chances of tractability I might have. | |
| Aug 29, 2016 at 20:14 | comment | added | fedja | By the "minimal spanning tree" do you mean the connected tree with the vertices $x_j$ and the minimal total edge length or extra vertices are allowed (it is the same up to a factor of $2$, of course, but I am still curious). | |
| Aug 29, 2016 at 17:20 | history | asked | Tom Solberg | CC BY-SA 3.0 |