ALGORITHMS FOR FINDING P-CENTERS ON A WEIGHTED TREE (FOR RELATIVELY SMALL P)

被引：19
|
作者：
JEGER, M
KARIV, O
机构：
[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL
[2] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
来源：
NETWORKS | 1985年 / 15卷 / 03期
关键词：
D O I：
10.1002/net.3230150308
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：381 / 389
页数：9
相关论文
共 50 条
  • [1] POLYNOMIALLY BOUNDED ALGORITHMS FOR LOCATING P-CENTERS ON A TREE
    CHANDRASEKARAN, R
    TAMIR, A
    MATHEMATICAL PROGRAMMING, 1982, 22 (03) : 304 - 315
  • [2] Weighted p-centers and the convex hull property
    Benítez, C
    Fernández, M
    Soriano, ML
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2002, 23 (1-2) : 39 - 45
  • [3] P-CENTERS ON BITREES
    CHEN, ML
    FRANCIS, RL
    LOWE, TJ
    JOURNAL OF REGIONAL SCIENCE, 1984, 24 (02) : 203 - 217
  • [4] PERCEPTUAL CENTERS (P-CENTERS)
    MORTON, J
    MARCUS, S
    FRANKISH, C
    PSYCHOLOGICAL REVIEW, 1976, 83 (05) : 405 - 408
  • [5] Fast Approximation Algorithms for p-centers in Large δ-hyperbolic Graphs
    Edwards, Katherine
    Kennedy, Sean
    Saniee, Iraj
    ALGORITHMS AND MODELS FOR THE WEB GRAPH, WAW 2016, 2016, 10088 : 60 - 73
  • [6] Fast Approximation Algorithms for p-Centers in Large δ-Hyperbolic Graphs
    Edwards, Katherine
    Kennedy, W. Sean
    Saniee, Iraj
    ALGORITHMICA, 2018, 80 (12) : 3889 - 3907
  • [7] Finding r-dominating sets and p-centers of trees in parallel
    Wang, BF
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2004, 15 (08) : 687 - 698
  • [8] P-CENTERS ARE UNAFFECTED BY PHONETIC CATEGORIZATION
    COOPER, AM
    WHALEN, DH
    FOWLER, CA
    PERCEPTION & PSYCHOPHYSICS, 1986, 39 (03): : 187 - 196
  • [9] Strong unicity of restricted p-centers
    Pai, D. V.
    NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2008, 29 (5-6) : 638 - 659
  • [10] Rapidly converging solution for p-centers in nonconvex regions
    Mangla, Monika
    Garg, Deepak
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2017, 25 (03) : 2424 - 2433
12345