![[ICO]](/icons/blank.gif){kind=icon}
![[PARENTDIR]](/icons/back.gif){kind=icon}
![[ ]](/icons/layout.gif){kind=icon}
![[ ]](/icons/unknown.gif){kind=icon}
| Name | Last modified | Size | Description |
|---|---|---|---|---|
| Parent Directory | - | ||
| (2008) 138–141 Well-separated pair decomposition in linear time.pdf | 2013-05-28 04:42 | 131K | |
| A parallel multistart algorithm for the closest string problem.pdf | 2013-05-28 04:42 | 148K | |
| A Heuristic with Worst-case Analysis for Minimax Routing.ppt | 2013-05-28 04:42 | 175K | |
| Well-separated pair decomposition in linear time(new).pptx | 2013-05-28 04:42 | 328K | |
| A parallel multistart algorithm for the closest string problem-zin.ppt | 2013-05-28 04:42 | 464K | |
| A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree.pdf | 2013-05-28 04:42 | 863K | |