Give stronger lower bounds on the approximability of the Steiner Forest problem, and characterize its fixed-parameter complexity when the parameter depends on the number of…
Statement
Give stronger lower bounds on the approximability of the Steiner Forest problem, and characterize its fixed-parameter complexity when the parameter depends on the number of terminal sets.
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.