Poster: An FPTAS for Shortest-Longest Path Problem
Motivated by multi-domain Service Function Chain (SFC) orchestration, we define the Shortest-Longest Path (SLP) problem, prove its hardness, and design an efficient Fully Polynomial Time Approximation Scheme (FPTAS) using the scaling and rounding technique to compute an approximation solution with provable performance guarantee.
Authors
- B. Cui (ORCID: https://orcid.org/0000-0002-4844-9486)
- Jianwei Zhang (ORCID: https://orcid.org/0000-0002-5491-1745)
- Xin Li (ORCID: https://orcid.org/0000-0003-0348-5384)
- Chunling Yang (ORCID: https://orcid.org/0000-0002-3918-1801)
Institutions
- Yunnan University (CN)
- Zhejiang University (CN)
Publication Details
- Published
- 2024-10-28
- DOI
- https://doi.org/10.1109/icnp61940.2024.10858508
- Primary Topic
- Software System Performance and Reliability
- Type
- article
- Field-Weighted Citation Impact
- 0.00