"Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier ..."

Jean-Romain Luttringer et al. (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-04-09

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2011-05191
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-05191
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser:
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. CoRR abs/2011.05191 (2020)

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.