Timeline for Are there variants of Euclidean Steiner Tree problem that are known to be in P?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 13, 2023 at 18:19 | vote | accept | Nandakumar R | ||
| Jul 13, 2023 at 18:19 | vote | accept | Nandakumar R | ||
| S Jul 13, 2023 at 18:19 | |||||
| Jul 6, 2023 at 12:31 | answer | added | Joseph O'Rourke | timeline score: 1 | |
| Jun 22, 2023 at 3:36 | answer | added | Gerry Myerson | timeline score: 2 | |
| Jun 21, 2023 at 18:48 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 16 characters in body
|
| Jun 21, 2023 at 18:36 | history | edited | Nandakumar R | CC BY-SA 4.0 |
deleted 103 characters in body
|
| Jun 21, 2023 at 18:16 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 106 characters in body
|
| Jun 21, 2023 at 18:14 | comment | added | Nandakumar R | Thanks. However, some constrained (and still nontrivial) versions of the tsp could be in P. And I guess TSP has received a lot more attention than the Steiner tree. | |
| Jun 21, 2023 at 13:45 | comment | added | Bill Bradley | FWIW, the metric traveling salesman problem is NP-complete, which may address the implicit question in your "Note". | |
| Jun 21, 2023 at 11:19 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 79 characters in body
|
| Jun 21, 2023 at 9:31 | history | edited | Nandakumar R | CC BY-SA 4.0 |
added 34 characters in body
|
| Jun 21, 2023 at 8:46 | history | asked | Nandakumar R | CC BY-SA 4.0 |