Approximation Algorithms for Node-Weighted Directed Steiner Problems.

Gianlorenzo D'Angelo Esmaeil Delfaraz

Published in: IWOCA (2024)

Keyphrases

approximation algorithms
vertex cover
randomized algorithms
approximation schemes
np hard
worst case
np hardness
undirected graph
exact algorithms
network design problem
disjoint paths
special case
minimum cost
set cover
open shop
bipartite graph