Hardness and Approximation Results for Packing Steiner Trees.

Joseph Cheriyan Mohammad R. Salavatipour

Published in: ESA (2004)

Keyphrases

steiner tree
packing problem
minimum spanning tree
linear programming relaxation
approximation algorithms
np hard
computational complexity
lower bound
probabilistic model
decision makers
random walk
mixed integer programming