An Exact Polynomial Algorithm for the Outerplanar Facility Location Problem with Improved Time Complexity.

Published in: AIST (2017)

Keyphrases

worst case
computational complexity
facility location problem
dominating set
graph isomorphism
probabilistic model
np hard
dynamic programming
search space
objective function
data mining
upper bound
energy function
tree structure
lower and upper bounds
high dimensional
optimal solution