Why is the following optimization problem NP-hard: given a directed graph D=(V,A), a root r, and a cost vector c^v for each v\ne r, find an arborescence T minimizing the sum…
Statement
Why is the following optimization problem NP-hard: given a directed graph D=(V,A), a root r, and a cost vector c^v for each v\ne r, find an arborescence T minimizing the sum over v\ne r of c^v(P^v), where P^v is the r-to-v path in T?
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.