Cloudburst 发表于 2025-4-1 05:26:31

An Improved Approximation Algorithm for the Terminal Steiner Tree Problemaper, we present an approximation algorithm with performance ratio . for the terminal Steiner tree problem, where . is the best-known performance ratio for the Steiner tree problem with any . ≥ 2. When we let . = 3.87 ≈ 4, this result improves the previous performance ratio of 2.515 to 2.458.

negotiable 发表于 2025-4-1 06:06:36

http://reply.papertrans.cn/24/2330/232954/232954_62.png

VOK 发表于 2025-4-1 13:41:11

http://reply.papertrans.cn/24/2330/232954/232954_63.png
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: Computational Science and Its Applications - ICCSA 2011; International Confer Beniamino Murgante,Osvaldo Gervasi,Bernady O. Apdu Conference