Abstract
We pose a new network flow problem and solve it by reducing to the b-matching problem. The result has application to integer multiflow optimization.
| Original language | English |
|---|---|
| Pages (from-to) | 185-197 |
| Number of pages | 13 |
| Journal | Journal of Combinatorial Theory. Series B |
| Volume | 78 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Mar 2000 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics