Arborescences and NP-hardness
Statement
Is the following optimization problem NP-hard? Given an undirected graph and, for each node , a cost vector , where is the set of all directed versions of the edges of , find a spanning tree that minimizes , where is the arborescence rooted at induced by .
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.