A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.

Lehilton Lelis Chaves Pedrosa Hugo Kooki Kasuya Rosado

Published in: Algorithmica (2022)

Keyphrases

prize collecting
travel time
closed form
approximation algorithms
error bounds
single machine scheduling problem
three dimensional
linear programming
approximation error