Approximation Algorithms for Priority Steiner Tree Problems.

Faryad Darabi Sahneh Stephen G. Kobourov Richard Spence

Published in: COCOON (2021)

Keyphrases

approximation algorithms
vertex cover
steiner tree
np hard
randomized algorithms
np hardness
special case
approximation schemes
optimization problems
minimum cost
computational complexity
worst case
np complete
shortest path
knapsack problem
undirected graph
primal dual