"A Randomized Fully Polynomial Time Approximation Scheme for the ..."

David R. Karger (2001)

> Home

Details and statistics

DOI: 10.1137/S0036144501387141

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamrev/Karger01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamrev/Karger01
David R. Karger:
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. SIAM Rev. 43(3): 499-522 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.