有界长度路径上的最大流与最小割：复杂性、算法与近似

Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation

• A. Ridha Mahjoub 通讯
• S. Thomas McCormick