An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

Jochen Könemann Sina Sadeghian Sadeghabad Laura Sanità

Published in: CoRR (2013)

Keyphrases

tree structure
prize collecting
worst case
social networks
optimal solution
dynamic programming
particle swarm optimization
hybrid algorithm
benchmark problems
steiner tree
computational complexity
lower bound
search space
np hard
segmentation algorithm
knapsack problem