Login / Signup
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem.
Roberto Aringhieri
Andrea Grosso
Pierre Hosteins
Rosario Scatamacchia
Published in:
Discret. Appl. Math. (2019)
Keyphrases
</>
worst case
computational complexity
significant improvement
orders of magnitude
learning algorithm
data structure
computational cost
optimization problems
distance measure
data sets
computationally efficient
distance transform
computational problems