| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143175 | Operations Research Letters | 2007 | 6 Pages |
Abstract
Given an arc-capacitated digraph and k terminal vertices, the directed maximum integer multiterminal flow problem is to route the maximum number of flow units between the terminals. We introduce a new parameter kL⩽kkL⩽k for this problem and study its complexity with respect to kLkL.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Cédric Bentz,