The degree-constrained, radius-constrained minimum spanning tree problem was put forward, and it was proved to be NP-complete. A mathematics programming model of the problem and a fast heuristic algorithm were proposed to solve the model. The time complexity of the algorithm was analyzed. The algorithm was proved to be effective by analysis and experiments.%介绍了空间数据库的特征及其在旅游业的应用.探讨了有关工业遗产旅游开发过程中的空间数据库的设计.
展开▼
