Name
Abstract | ||
|---|---|---|
In the simple assignment problem, there are n processors, m tasks, and a relation between the processors and tasks; this relation indicates the ability of the processor to perform the task. When the processors fail independently with known probabilities, two performance issues arise. First, with what probability can the operating processors all be kept busy? Second, with what probability can the operating processors perform the same number of tasks that all processors could? We formulate these questions on the underlying transversal matroid. We first prove that counting minimum cardinality circuits in this matroid is # P-complete and, hence, that both questions are also # P-complete. Secondly, we devise a factoring algorithm with series and parallel reductions to compute the exact solutions of the above problems. We then outline some efficient strategies for bounding the probabilities. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0012-365X(93)90360-6 | Discrete Mathematics |
Keywords | Field | DocType |
reliable assignment,assignment problem,exact solution | Matroid,Graph theory,Discrete mathematics,Combinatorics,Cardinality,Transversal (geometry),Assignment problem,Mathematics,Factoring,Bounding overwatch | Journal |
Volume | Issue | ISSN |
114 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.85 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Charles J. Colbourn | 1 | 2726 | 290.04 |
| Ehab S. Elmallah | 2 | 105 | 19.29 |