Maximizing Expectation on Vertex-Disjoint Cycle Packing
Maximizing Expectation on Vertex-Disjoint Cycle Packing
| dc.contributor.author | João Pedro Pedroso | en |
| dc.date.accessioned | 2018-01-06T09:43:36Z | |
| dc.date.available | 2018-01-06T09:43:36Z | |
| dc.date.issued | 2014 | en |
| dc.description.abstract | This paper proposes a method for computing the expectation for the length of a maximum set of vertex-disjoint cycles in a digraph where vertices and/or arcs are subject to failure with a known probability. This method has an immediate practical application: it can be used for the solution of a kidney exchange program in the common situation where the underlying graph is unreliable. Results for realistic benchmark instances are reported and analyzed. | en |
| dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/5624 | |
| dc.identifier.uri | http://dx.doi.org/10.1007/978-3-319-09129-7_3 | en |
| dc.language | eng | en |
| dc.relation | 4747 | en |
| dc.rights | info:eu-repo/semantics/embargoedAccess | en |
| dc.title | Maximizing Expectation on Vertex-Disjoint Cycle Packing | en |
| dc.type | conferenceObject | en |
| dc.type | Publication | en |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- P-009-MKJ.pdf
- Size:
- 1.42 MB
- Format:
- Adobe Portable Document Format
- Description: