On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs.
Indaco BiazzoAlfredo BraunsteinRiccardo ZecchinaPublished in: CoRR (2013)
Keyphrases
- prize collecting
- dynamic programming
- high accuracy
- cost function
- optimization algorithm
- computational cost
- objective function
- k means
- detection algorithm
- computational complexity
- adjacency graph
- minimum spanning tree
- preprocessing
- segmentation method
- segmentation algorithm
- clustering method
- similarity measure
- probabilistic model
- energy function
- computational efficiency
- optimization method
- matching algorithm
- search procedure
- learning algorithm
- np hard
- convergence rate
- search strategy
- linear programming
- optimal solution
- graph matching
- search space
- multi objective
- spanning tree
- standard deviation
- combinatorial optimization
- error rate