Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.00938 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910331832369152 |
|---|---|
| author | Feng, Weiming Guo, Heng |
| author_facet | Feng, Weiming Guo, Heng |
| contents | We give a fully polynomial-time randomized approximation scheme (FPRAS) for two terminal reliability in directed acyclic graphs (DAGs). In contrast, we also show the complementing problem of approximating two terminal unreliability in DAGs is #BIS-hard. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_00938 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | An FPRAS for two terminal reliability in directed acyclic graphs Feng, Weiming Guo, Heng Data Structures and Algorithms We give a fully polynomial-time randomized approximation scheme (FPRAS) for two terminal reliability in directed acyclic graphs (DAGs). In contrast, we also show the complementing problem of approximating two terminal unreliability in DAGs is #BIS-hard. |
| title | An FPRAS for two terminal reliability in directed acyclic graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2310.00938 |