View source for Publication:2638376

You do not have permission to edit this page, for the following reasons:

• The action you have requested is limited to users in the group: Users.
• You do not have permission to edit pages in the Publication namespace.

You can view and copy the source of this page.

Return to Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation.