Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663790 | European Journal of Operational Research | 2005 | 11 Pages |
Abstract
We prove that this problem is polynomial for two tasks using a flow algorithm. We also prove that it is NP-complete in the strong sense for three tasks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alix Munier Kordon, Jean-Baptiste Note,