Locating the vertices of a steiner tree in an arbitrary metric space
From MaRDI portal
Publication:4077102
Cites work
- scientific article; zbMATH DE number 3401212 (Why is no real title available?)
- A note on Fermat's problem
- An algorithm for the distance between two finite sequences
- Minimal Mutation Trees of Sequences
- On Steiner Minimal Trees with Rectilinear Distance
- On Steiner’s Problem with Rectilinear Distance
- On the Problem of Steiner
- Steiner Minimal Trees
- The String-to-String Correction Problem
Cited in
(16)- Minimum Steiner trees in normed planes
- Semimetric properties of Sørensen-Dice and Tversky indexes
- The computational complexity of calculating partition functions of optimal medians with Hamming distance
- The Steiner ratio for the dual normed plane
- Approximation algorithms for tree alignment with a given phylogeny
- Minimally colored trees
- Worst-case minimum rectilinear Steiner trees in all dimensions
- A lower bound for the breakpoint phylogeny problem
- How to infer ancestral genome features by parsimony: dynamic programming over an evolutionary tree
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
- A tight lower bound for the Steiner ratio in Minkowski planes
- Counting and sampling SCJ small parsimony solutions
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
- On computing the maximum parsimony score of a phylogenetic network
- Fixed topology Steiner trees and spanning forests
- Weber's problem and weiszfeld's algorithm in general spaces
This page was built for publication: Locating the vertices of a steiner tree in an arbitrary metric space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077102)
