The complexity of computing the random priority allocation matrix
Daniela Saban; Jay Sethuraman
| Year of publication: |
2015
|
|---|---|
| Authors: | Saban, Daniela ; Sethuraman, Jay |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 4, p. 1005-1014
|
| Subject: | networks | graphs | randomized algorithms | random priority | assignment | matching | complexity | Graphentheorie | Graph theory | Algorithmus | Algorithm | Allokation | Allocation | Matching | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011409034