Farthest neighbors, maximum spanning trees and related problems in higher dimensions

被引：44

|

作者：

Agarwal, P.K.

Matousek, J.

Suri, S.

机构：

来源：

Computational Geometry: Theory and Applications | 1992年 / 1卷 / 04期

关键词：

D O I：

10.1016/0925-7721(92)90001-9

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[41] Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems
Brockbank, Simon
Pesant, Gilles
Rousseau, Louis-Martin
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 175 - 183
[42] Strictly kth minimum spanning trees problems
Li, Bang-Yi
Yao, En-Yu
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2002, 22 (01):
[43] MULTICRITERION PROBLEMS OF GRAPH SPANNING-TREES
EMELICHEV, VA
PEREPELITSA, VA
DOKLADY AKADEMII NAUK SSSR, 1988, 298 (03): : 544 - 547
[44] An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems
Spoerhase, Joachim
ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 440 - 450
[45] ON CONSTRUCTING MINIMUM SPANNING-TREES IN KAPPA-DIMENSIONAL SPACES AND RELATED PROBLEMS
YAO, ACC
SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 721 - 736
[46] Complexities of some interesting problems on spanning trees
Rahman, MS
Kaykobad, M
INFORMATION PROCESSING LETTERS, 2005, 94 (02) : 93 - 97
[47] Constructing Euclidean Minimum Spanning Trees and all nearest neighbors on reconfigurable meshes
Lai, TH
Sheng, MJ
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (08) : 806 - 817
[48] Constructing Euclidean minimum spanning trees and all nearest neighbors on reconfigurable meshes
Ohio State Univ, Columbus, United States
IEEE Trans Parallel Distrib Syst, 8 (806-817):
[49] On the approximability of some maximum spanning tree problems
Galbiati, G
Morzenti, A
Maffioli, F
THEORETICAL COMPUTER SCIENCE, 1997, 181 (01) : 107 - 118
[50] ON THE APPROXIMABILITY OF SOME MAXIMUM SPANNING TREE PROBLEMS
GALBIATI, G
MORZENTI, A
MAFFIOLI, F
LATIN '95: THEORETICAL INFORMATICS, 1995, 911 : 300 - 310

← 1 2 3 4 5 →