Tony's Log

Algorithms, Distributed System, Machine Learning

:: :: :: :: :: ::

08 2016 档案

摘要：A bit Greedy can achieve O(m) - the mid station between 2 adjacent cities has the longest distance within that range. 阅读全文

posted @ 2016-08-07 13:53 Tonix 阅读(275) 评论(0) 推荐(0)