Improved approximation for Fractionally Subadditive Network Design

Information Processing Letters（2020）

引用 0|浏览8

暂无评分

摘要

•A 23k-approximation algorithm for the f-SAND problem.•Proof of the approximation ratio uses only simple flow arithmetic.•Similar algorithms cannot give a constant approximation ratio.

查看译文

关键词

Flow,Approximation algorithms,Network design

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要