Login / Signup
A polynomial time approximation scheme for rectilinear Steiner minimum tree construction in the presence of obstacles.
Jian Liu
Ying Zhao
Eugene Shragowitz
George Karypis
Published in:
ICECS (2002)
Keyphrases
</>
polynomial time approximation
tree construction
approximation algorithms
np hard
error bounds
decision trees
minimum cost
r tree
suffix tree
bin packing
constant factor
training data
neural network
special case
knn
linear program