Computing Steiner Minimum Trees in Hamming Metric

被引：7

作者：

Althaus, Ernst ^{[1
]}

Naujoks, Rouven ^{[2
]}

机构：

[1] Univ Henri Poincare, LORIA, Vandoeuvre Les Nancy, France

[2] Max Planck Inst Informat, Saarbrucken, Germany

来源：

PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2006年

关键词：

D O I：

10.1145/1109557.1109578

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Computing Steiner minimum trees in Hamming metric is a well studied problem that has applications in several fields of science such as computational linguistics and computational biology. Among all methods for finding such trees, algorithms using variations of a branch and bound method developed by Penny and Hendy have been the fastest for more than 20 years. In this paper we describe a new pruning approach that is superior to previous methods and its implementation.

引用

页码：172 / +

页数：3

共 50 条

[31] Simple distributed algorithms for approximating minimum Steiner trees
Chalermsook, P
Fakcharoenphol, J
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 380 - 389
[32] Grade of Service Steiner Minimum Trees in the Euclidean Plane
Algorithmica, 2001, 31 : 479 - 500
[33] Minimum diameter cost-constrained Steiner trees
Wei Ding
Guoliang Xue
Journal of Combinatorial Optimization, 2014, 27 : 32 - 48
[34] Minimum diameter cost-constrained Steiner trees
Ding, Wei
Xue, Guoliang
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 32 - 48
[35] Euclidean Steiner minimum trees: An improved exact algorithm
Winter, P
Zachariasen, M
NETWORKS, 1997, 30 (03) : 149 - 166
[36] Two special cases for rectilinear Steiner minimum trees
Du, DZ
Shragowitz, E
Wan, PJ
NETWORK OPTIMIZATION, 1997, 450 : 221 - 233
[37] NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE
Wang, Qin
Wu, Longshu
ANZIAM JOURNAL, 2017, 58 (3-4): : 342 - 349
[38] 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
[39] Computing minimum spanning trees with uncertainty
Erlebach, Thomas
Hoffmann, Michael
Krizanc, Danny
Mihal'ak, Matus
Raman, Rajeev
STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 277 - +
[40] Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid
Lin, Sheng-En David
Kim, Dae Hyun
PROCEEDINGS OF THE 2018 INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN (ISPD'18), 2018, : 18 - 25

← 1 2 3 4 5 →