An Efficient Approximation Algorithm for the Shortest-Longest Path Problem in Multi-Domain Networks

An efficient Fully Polynomial Time Approximation Scheme (FPTAS) is designed to solve the Shortest-Longest Path (SLP) problem, which has theoretical significance in multi-criteria optimization and practical applications in QoS routing and multi-domain network resource allocation.