S-T edge-connectivity augmentation
Statement
Given a digraph D=(V,A), two (not necessarily disjoint) subsets and a connectivity requirement k, develop a strongly polynomial time combinatorial algorithm for finding a minimum cardinality arc-set whose addition makes D k-edge-connected between S and T, that is, it contains k edge-disjoint paths from any node in S to any node 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.