0
$\begingroup$

I want to solve a network flow problem with the usual setup of a directed graph with a capacity value for each edge. However, I also have an additional constraint: I want to find the maximum flow through any subset of size K of the vertices of the network.

Informally, I think there's not going to be a polynomial time solution to this problem because given a solution, merely verifying that the flow is maximal among all possible sets of nodes of size K is hard.

Any thoughts?

Thanks!

$\endgroup$
  • $\begingroup$ Can you clarify your question a bit? (1) Given k do you want to find the subset of vertices of size k that has the most flow going through them or (2) Given a fixed subset of size k, you want to reroute the max flow to have as much flow as possible through these k vertices? $\endgroup$ – Sandeep Silwal Dec 3 '18 at 15:45

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.