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 条
  • [21] THE MAXIMUM DISTANCE PROBLEM AND MINIMUM SPANNING TREES
    Alvarado, Enrique G.
    Krishnamoorthy, Bala
    Vixie, Kevin R.
    INTERNATIONAL JOURNAL OF ANALYSIS AND APPLICATIONS, 2021, 19 (05): : 633 - 659
  • [22] COMPUTING EUCLIDEAN MAXIMUM SPANNING-TREES
    MONMA, C
    PATERSON, M
    SURI, S
    YAO, F
    ALGORITHMICA, 1990, 5 (03) : 407 - 419
  • [23] Spanning trees with low maximum/average stretch
    Peleg, D
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2003, 2653 : 6 - 6
  • [24] Spanning trees in random satisfiability problems
    Ramezanpour, A.
    Moghimi-Araghi, S.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2006, 39 (18): : 4901 - 4909
  • [25] TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES
    Eppstein, David
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1994, 4 (02) : 229 - 238
  • [26] Degree bounded bottleneck spanning trees in three dimensions
    Patrick J. Andersen
    Charl J. Ras
    Journal of Combinatorial Optimization, 2020, 39 : 457 - 491
  • [27] Degree bounded bottleneck spanning trees in three dimensions
    Andersen, Patrick J.
    Ras, Charl J.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (02) : 457 - 491
  • [28] Sharing the cost of maximum quality optimal spanning trees
    Subiza, Begona
    Peris, Josep E.
    TOP, 2021, 29 (02) : 470 - 493
  • [29] Finding maximum-cost minimum spanning trees
    Belal, Ahmed
    Elmasry, Arnr
    3RD ACS/IEEE INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, 2005, 2005,
  • [30] Hardness and efficiency on minimizing maximum distances in spanning trees
    Couto, Fernanda
    Cunha, Luis Felipe, I
    THEORETICAL COMPUTER SCIENCE, 2020, 838 : 168 - 179
12345