"Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees."

Davide Bilò et al. (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2016.18

access: open

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/BiloG0P16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BiloG0P16
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS 2016: 18:1-18:14

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.