Computing optimal shortcuts for networks

Delia Garijo,Alberto Márquez, Natalia Rodríguez,Rodrigo I. Silveira

European Journal of Operational Research（2019）

引用 3|浏览17

暂无评分

摘要

•We study adding one segment to a plane Euclidean network to reduce its diameter.•An optimal segment can be found in polynomial time, but the running time is high.•We give a faster approximation algorithm and a faster algorithm for paths networks.

查看译文

关键词

Networks,Geometric algorithm,Complexity,Discrete optimization,Graph augmentation

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要