Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights
暂无分享,去创建一个
[1] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[2] David J. DeWitt,et al. A taxonomy of parallel sorting , 1984, CSUR.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[5] Jan Karel Lenstra,et al. The Parallel Complexity of TSP Heuristics , 1989, J. Algorithms.
[6] Ján Plesník,et al. A heuristic for the p-center problems in graphs , 1987, Discret. Appl. Math..
[7] Michael J. Quinn,et al. Parallel graph algorithms , 1984, CSUR.
[8] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[9] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.
[10] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.
[11] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[12] David B. Shmoys,et al. A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.