Viet_love_MD's blog

MAXIMUM flow I mean help me no idea
By Viet_love_MD, history, 2 years ago, In English

given a bipartite graph we call L as the left one and R as the right one for each node i we choose in L we have to pay a[i] dollar . there are m edges L[i] and R[j] m <= (|L|*|R|) ask : what is the minumum value of choose some node in L so that every node in R have at least 2 node in L is linked to this is chosen p/s sorry for my poor Engligh but if you understand the statement please give feedback

  • Vote: I like it
  • -14
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I am fairly certain that one could nodify slightly the structure of flows with demands as to accept costs as well

→ Reply