A series of approximation algorithms for the acyclic directed steiner tree problem

This publication has 13 references indexed in Scilit:

• On better heuristic for Euclidean Steiner minimum trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Approaching the 5/4 — approximation for rectilinear Steiner trees
  Published by Springer Nature ,1994
• On the hardness of approximating minimization problems
  Published by Association for Computing Machinery (ACM) ,1993
• Recent developments on the approximability of combinatorial problems
  Published by Springer Nature ,1993
• The rectilinear steiner arborescence problem
  Algorithmica, 1992
• The Steiner problem with edge lengths 1 and 2
  Information Processing Letters, 1989
• A faster approximation algorithm for the Steiner problem in graphs
  Information Processing Letters, 1988
• The computation of nearly minimal Steiner trees in graphs
  International Journal of Mathematical Education in Science and Technology, 1983
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
  Evolution, 1965