An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes.
Dimitri WatelMarc-Antoine WeisserCédric BentzDominique BarthPublished in: Inf. Process. Lett. (2015)
Keyphrases
- experimental evaluation
- times faster
- space complexity
- cost function
- computational complexity
- np hard
- dynamic programming
- computational cost
- learning algorithm
- k means
- objective function
- minimum spanning tree
- high accuracy
- recognition algorithm
- convergence rate
- significant improvement
- optimal solution
- neural network
- graph structure
- np complete
- memory requirements
- detection algorithm
- search space
- random graphs
- clustering method
- shortest path
- segmentation algorithm
- particle swarm optimization
- linear programming
- worst case
- preprocessing
- search algorithm
- similarity measure