Constant-factor performance of the same-set shortest-path heuristic for Steiner Forest
Statement
For the Steiner Forest Problem, consider the shortest-path heuristic that, at each step, connects two terminals belonging to the same terminal set and at minimum distance by a shortest path. Is this heuristic a constant-ratio approximation?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.