1 Andrea Garratt,Mike Jackson,Peter Burden,Jon Wallis. A survey of alternative designs for a search engine storage structure: Information and Sostware Technology 43(2001) 661-677
2 Moffat, A.,Lang Stuiver. Binary interpolative Coding for Effective Index Compression: Information Retrieval 3(2000) 25-47
3 Navarro, Gonzalov. Adding compression to Block Addressing inverted Indexes: Information Retrieval 2000(07) 49-77
4 Trotman, Andrew. Compressing Inverted Files: Information Retrieval;2003(01) 5-19
5 Moffat, A., & Zobel, J. (1996). Self-indexing inverted files for fast text retrieval: Information Syst., 14(4) 249-279
6 He X. Yesha Y. A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs: SIAM J Comput., 1988, 174-185
7 Djidjev H V,Pantziou G E,Zaroliagis C D. Computing shortest paths and distances in planar graphs. In. FOCS' 87(1987) 238-248
8 Gregory Gutin, Anders Yeo, Alexey Zverovich. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 117(2002) 81-86
9 A.I. Serdjukov. On finding a maximum spanning tree of bounded radius: Discrete Applied Mathematics 114(2001) 249-253
10 Lawler, E.L., Lenstra, J.K., Rinnooy, A.H.G., & Shmoys, D.B. The Traveling Salesman Problem—A Guided Tour of Combinatorial Optimization. New York: Wiley-Interscience Publication.
11 陈国良,梁维发,沈鸿.并行图论算法研究进展.计算机研究与发展,1995(9)
12 潘立登,黄晓峰.用启发式贪心法求解旅行商问题.北京化工大学学报,1998(2)
13 姚朝灼.顶点覆盖问题的贪心算法的设计与分析.福州大学学报,2001(1)
14 段禅伦,斯勤夫.关于旅行推销员问题的一个算法.内蒙古大学学报,2001(6)
15 姜洪溪,陈丹.利用找环去边法求最小生成树的算法探析.襄樊学院学报,2002(9)
16 陈建二,王伟平,张祖平.关于实际构造最大带宽路径算法的研究.计算机学报,2002(10) |