搜索结果: 1-1 共查到“函数逼近论 Directed Spanner Problem”相关记录1条 . 查询时间(0.046 秒)
Improved Approximation for the Directed Spanner Problem
Approximation Directed Spanner Problem
2011/3/3
We prove that the size of the sparsest directed k-spanner of a graph can be approximated in polynomial time to within a factor of ˜O(√n), for all k ≥ 3. This improves the ˜O(n2/3)-
approxim...