On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric

DOI10.1007/978-3-642-20877-5_31zbMath1331.68087OpenAlexW2129026537MaRDI QIDQ3010411

Rouven Naujoks, Joschka Kupilas, Ernst Althaus

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_31

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• The Steiner problem in phylogeny is NP-complete
• The Steiner ratio of several discrete metric spaces
• An improved LP-based approximation for steiner tree
• Computing steiner minimum trees in Hamming metric
• Tighter Bounds for Graph Steiner Tree Approximation

This page was built for publication: On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric