| dc.contributor.author | Loh, Rue-chze | |
| dc.contributor.author | Soh, Sie Teng | |
| dc.contributor.author | Lazarescu, Mihai | |
| dc.date.accessioned | 2017-03-15T22:05:51Z | |
| dc.date.available | 2017-03-15T22:05:51Z | |
| dc.date.created | 2017-02-24T00:09:33Z | |
| dc.date.issued | 2011 | |
| dc.identifier.citation | Loh, R. and Soh, S.T. and Lazarescu, M. 2011. Addressing the most reliable edge-disjoint paths with a delay constraint. IEEE Transactions on Reliability. 60 (1): pp. 88-93. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/49558 | |
| dc.publisher | IEEE | |
| dc.subject | network reliability | |
| dc.subject | multi-constrained edge-disjoint paths | |
| dc.subject | network delay | |
| dc.subject | lagrange relaxation | |
| dc.subject | approximate algorithm | |
| dc.title | Addressing the most reliable edge-disjoint paths with a delay constraint | |
| dc.type | Journal Article | |
| dcterms.source.volume | 60 | |
| dcterms.source.number | 1 | |
| dcterms.source.startPage | 88 | |
| dcterms.source.endPage | 93 | |
| dcterms.source.issn | 0018-9529 | |
| dcterms.source.title | IEEE Transactions on Reliability | |
| curtin.department | Department of Computing | |
| curtin.accessStatus | Fulltext not available | |
