AN O(N LOG N) ALGORITHM FOR THE ALL-NEAREST-NEIGHBORS PROBLEM

被引：143

作者：

VAIDYA, PM ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1989年 / 4卷 / 02期

关键词：

D O I：

10.1007/BF02187718

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：101 / 115

页数：15

共 50 条

[21] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
Han, Yijie
ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
[22] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[23] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[24] An O(n(m plus n log n) log n) time algorithm to solve the minimum cost tension problem
Ghiyasvand, Mehdi
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 957 - 969
[25] A simplified algorithm for the all pairs shortest path problem with O(n2 log n) expected time
Takaoka, Tadao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 326 - 337
[26] A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2 log n) Expected Time
Takaoka, Tadao
Hashim, Mashitoh
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 195 - 206
[27] An O(n√n, log log n) average case algorithm for the maximum induced matching problem in permutation graphs
Viet Cuong Than
Phan Thuan Do
PROCEEDINGS OF THE 2018 5TH ASIAN CONFERENCE ON DEFENSE TECHNOLOGY (ACDT 2018), 2018, : 45 - 49
[28] An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Cole, R
Colton, MF
Hariharan, R
Przytycka, T
Thorup, M
SIAM JOURNAL ON COMPUTING, 2000, 30 (05) : 1385 - 1404
[29] O(N LOG N) ALGORITHM FOR THE RECTILINEAR ROUND-TRIP LOCATION PROBLEM
DREZNER, Z
TRANSPORTATION SCIENCE, 1985, 19 (01) : 91 - 93
[30] AN O(N LOG2N) ALGORITHM FOR THE MAXIMUM WEIGHTED TARDINESS PROBLEM
HOCHBAUM, DS
SHAMIR, R
INFORMATION PROCESSING LETTERS, 1989, 31 (04) : 215 - 219

← 1 2 3 4 5 →