An FPTAS for Shortest-Longest Path Problem
<|reference_start|>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. The SLP problem and its solution algorithm have theoretical significance in multicriteria optimization and also have application potential in QoS routing and multi-domain network resource allocation scenarios.<|reference_end|>
@article{zhang2024an,
    title={An FPTAS for Shortest-Longest Path Problem},
    author={Jianwei Zhang},
    journal={arXiv preprint arXiv:2404.13488},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.13488},
    primaryClass={cs.NI}
}