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 条

[41] On efficiency group multicasting algorithm with multiple minimum Steiner trees
Kim, Moonseong
Kang, Minseok
Choo, Hyunseung
Yang, Jong S.
Bang, Young-Cheol
COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 432 - 439
[42] Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees
Bernhard Fuchs
Walter Kern
Xinhui Wang
Mathematical Methods of Operations Research, 2007, 66 : 117 - 125
[43] Steiner minimum trees for equidistant points on two sides of an angle
Burkard, Rainer E.
Dudás, Tibor
Acta Cybernetica, 1996, 12 (03): : 313 - 324
[44] Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees
Univ of Vermont, Burlington, United States
Proc IEEE Int Conf Comput Des VLSI Comput Process, (392-398):
[45] COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN l(1) AND l(2) METRIC SPACES
Weng, J. F.
Mareels, I.
Thomas, D. A.
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (04) : 541 - 554
[46] Computing Steiner points for gradient-constrained minimum networks
Thomas, D. A.
Weng, J. F.
DISCRETE OPTIMIZATION, 2010, 7 (1-2) : 21 - 31
[47] Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
Ganley, JL
DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) : 161 - 171
[48] Computing Lower Bounds for Steiner Trees in Road Network Design
Schwartz, Justus
Stueckelberger, Juerg
OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2008, 8 : 172 - +
[49] A PARALLEL ALGORITHM FOR COMPUTING STEINER TREES IN STRONGLY CHORDAL GRAPHS
DAHLHAUS, E
DISCRETE APPLIED MATHEMATICS, 1994, 51 (1-2) : 47 - 61
[50] Efficiently Computing Directed Minimum Spanning Trees
Bother, Maximilian
Kissig, Otto
Weyand, Christopher
2023 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2023, : 86 - 95

← 1 2 3 4 5 →