Balancing minimum spanning trees and shortest-path trees

被引：0
|
作者：
Khuller, S.
Raghavachari, B.
Young, N.
机构：
来源：
Algorithmica (New York) | 1995年 / 14卷 / 04期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
    KHULLER, S
    RAGHAVACHARI, B
    YOUNG, N
    ALGORITHMICA, 1995, 14 (04) : 305 - 321
  • [2] SENSITIVITY ANALYSIS OF MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1982, 14 (01) : 30 - 33
  • [3] Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane
    Lin, GH
    Xue, GL
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 117 - 120
  • [4] A LINEAR ALGORITHM FOR ANALYSIS OF MINIMUM SPANNING AND SHORTEST-PATH TREES OF PLANAR GRAPHS
    BOOTH, H
    WESTBROOK, J
    ALGORITHMICA, 1994, 11 (04) : 341 - 352
  • [5] A NOTE ON FINDING SHORTEST-PATH TREES
    KERSHENBAUM, A
    NETWORKS, 1981, 11 (04) : 399 - 400
  • [6] Balancing Steiner trees and shortest path trees online
    Goel, A
    Munagala, K
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 562 - 563
  • [7] Indexing Network Structure with Shortest-Path Trees
    Maier, Marc
    Rattigan, Matthew
    Jensen, David
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (03)
  • [8] CONSTRUCTION OF CENTERED SHORTEST-PATH TREES IN NETWORKS
    WALL, DW
    OWICKI, S
    NETWORKS, 1983, 13 (02) : 207 - 231
  • [9] RECOGNIZING SHORTEST-PATH TREES IN LINEAR-TIME
    PENG, CH
    WANG, JS
    LEE, RCT
    INFORMATION PROCESSING LETTERS, 1994, 52 (02) : 77 - 85
  • [10] Fault-Tolerant Approximate Shortest-Path Trees
    Bilo, Davide
    Guala, Luciano
    Leucci, Stefano
    Proietti, Guido
    ALGORITHMS - ESA 2014, 2014, 8737 : 137 - 148
12345