A derandomized approximation algorithm for the critical node detection problem.

Mario Ventresca Dionne M. Aleman

Published in: Comput. Oper. Res. (2014)

Keyphrases

detection algorithm
detection method
improved algorithm
graph structure
dynamic programming
np hard
optimal solution
learning algorithm

preprocessing
computational complexity
convex hull
expectation maximization
similarity measure
false detections
finding the shortest path
closed form

tree structure
theoretical analysis
anomaly detection
computational cost
experimental evaluation
cost function
search space
segmentation algorithm

high accuracy
mobile robot
convergence rate
approximation algorithms
false alarms
polygonal approximation
significant improvement