![](images/graphics/blank.gif)
On the performance of a simple approximation algorithm for the longest path problem
40
lượt xem 0
download
lượt xem 0
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
The longest path problem is known to be NP-hard. Moreover, it cannot be approximated within a constant ratio, unless P = NP. The best known polynomial time approximation algorithms for this problem essentially find a path of length that is the logarithm of the optimum.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD