A GENERALIZED DIVIDE-AND-CONQUER STRATEGY AND ITS APPLICATION TO SOME EUCLIDEAN NP-HARD PROBLEMS
博士 === 國立清華大學 === 資訊科學研究所 === 79 === In this thesis, we propose a new strategy for designing algorithms, called the generalized divide- and- conquer strategy. Suppose that we have a problem to which the ordinary divide- and- conquer strategy can not be ap...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1990
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23585319351378266577 |