Hardness and Approximation of Octilinear Steiner Trees.

Matthias Müller-Hannemann Anna Schulze

Published in: Int. J. Comput. Geom. Appl. (2007)

Keyphrases

steiner tree
shortest path
computational complexity
approximation algorithms
minimum spanning tree
linear programming relaxation
facility location
np hard
linear programming
worst case
optimization problems
convex optimization
minimum cost