A 2-approximation for the k-prize-collecting Steiner tree problem.

Lehilton Lelis Chaves Pedrosa Hugo Kooki Kasuya Rosado

Published in: CoRR (2019)

Keyphrases

prize collecting
travel time
error bounds
approximation algorithms
closed form
computer vision
computational complexity
evolutionary algorithm
approximation error