Min-sum two edge-disjoint paths
Statement
Let G=(V,E) be an undirected graph and let be two node pairs. Give a combinatorial, polynomial-time algorithm to find edge-disjoint and paths with minimum total length.
Record
- Source
- Added
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.