Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree.
Parikshit SaikiaSushanta KarmakarAris PagourtzisPublished in: Discret. Math. Algorithms Appl. (2021)
Keyphrases
- primal dual
- prize collecting
- np hard
- convergence rate
- linear programming
- worst case
- computational complexity
- approximation algorithms
- optimal solution
- dynamic programming
- integrality gap
- search space
- input image
- algorithm for linear programming
- steiner tree
- linear programming relaxation
- semidefinite programming
- mathematical model
- cost function
- graph structure
- convex optimization
- single machine scheduling problem
- ant colony optimization
- interior point algorithm
- special case