arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.13488cs.NI
收藏

最短-最长路径问题的一种FPTAS

An FPTAS for Shortest-Longest Path Problem

Jianwei Zhang

AI总结:

受多域服务功能链编排启发,本文定义最短-最长路径问题,证明其困难性,并提出基于动态规划与缩放舍入的FPTAS,为QoS路由和多域资源分配提供有性能保证的近似解。

摘要:

受多域服务功能链(SFC)编排的启发,我们定义了最短-最长路径(SLP)问题,证明了其困难性,并利用动态规划(DP)以及缩放与舍入(SR)技术设计了一种高效的完全多项式时间近似方案(FPTAS),以计算具有可证明性能保证的近似解。SLP问题及其求解算法在多准则优化中具有理论意义,同时在QoS路由和多域网络资源分配场景中也具有应用潜力。

英文摘要:

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 dynamic programming (DP) and scaling and rounding (SR) techniques 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑