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 条
  • [41] The saga of minimum spanning trees
    Mares, Martin
    COMPUTER SCIENCE REVIEW, 2008, 2 (03) : 165 - 221
  • [42] CLUSTERING WITH MINIMUM SPANNING TREES
    Zhou, Yan
    Grygorash, Oleksandr
    Hain, Thomas F.
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2011, 20 (01) : 139 - 177
  • [43] The minimum cost shortest-path tree game
    F. R. Fernández
    J. Puerto
    Annals of Operations Research, 2012, 199 : 23 - 32
  • [44] The minimum cost shortest-path tree game
    Fernandez, F. R.
    Puerto, J.
    ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 23 - 32
  • [45] THE MINIMUM-COVERING SHORTEST-PATH PROBLEM
    CURRENT, J
    REVELLE, C
    COHON, J
    DECISION SCIENCES, 1988, 19 (03) : 490 - 503
  • [46] Delay-constrained minimum shortest path trees and related problems
    Lichen, Junran
    Cai, Lijian
    Li, Jianping
    Liu, Suding
    Pan, Pengxiang
    Wang, Wencheng
    THEORETICAL COMPUTER SCIENCE, 2023, 941 : 191 - 201
  • [47] Delay-Constrained Minimum Shortest Path Trees and Related Problems
    Lichen, Junran
    Cai, Lijian
    Li, Jianping
    Liu, Suding
    Pan, Pengxiang
    Wang, Wencheng
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 676 - 686
  • [48] An efficient technique for message flooding based on partial shortest-path trees in wired networks
    Ohtsuka, Kenji
    Sato, Takehiro
    Shioda, Shigeo
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 6425 - 6432
  • [49] Spanning trees and shortest paths in Monge graphs
    Dudas, T.
    Rudolf, R.
    Computing (Vienna/New York), 1998, 60 (02): : 109 - 119
  • [50] Spanning trees and shortest paths in Monge graphs
    Dudas, T
    Rudolf, R
    COMPUTING, 1998, 60 (02) : 109 - 119
12345