Hardness and Approximation of Octilinear Steiner Trees.

Matthias Müller-Hannemann Anna Schulze

Published in: ISAAC (2005)

Keyphrases

steiner tree
linear programming relaxation
minimum spanning tree
shortest path
facility location
computational complexity
approximation algorithms
bayesian networks
lower bound
np hard
worst case
np complete
random walk