Concepedia

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

Alex Zelikovsky

Algorithmica · 1997 · 129 citations · 14 references

DOI

Concepts

References

14

An approximate solution for the Steiner problem in graphs

Haruhisa Takahashi, A Matsuyama · Mathematica japonica · 1980 · 884 citations

, , +10

Proof verification and hardness of approximation problems

Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations

, , +16

A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY

Joseph H. Camin, Robert R. Sokal · Evolution · 1965 · 682 citations · Full text

, , +4

A faster approximation algorithm for the Steiner problem in graphs

Kurt Mehlhorn · Information Processing Letters · 1988 · 421 citations

, , +9

The Steiner problem with edge lengths 1 and 2

Marshall Bern, Paul E. Plassmann · Information Processing Letters · 1989 · 378 citations

, , +13