This document discusses introducing vertex capacity constraints bi for each vertex vi in a network flow problem, where the total flow passing through vi cannot exceed bi. It asks to describe an algorithm to solve the vertex capacity constrained max-flow problem by reducing it to an edge capacity network flow problem.