Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems

MohammadHossein Bateni MohammadTaghi Hajiaghayi Vahid Liaghat

Published in: CoRR (2013)

Keyphrases

approximation algorithms
vertex cover
np hardness
np hard
special case
approximation schemes
randomized algorithms
worst case
optimization problems
network design problem
exact algorithms
undirected graph
facility location problem
directed graph
disjoint paths
multi class
open shop