Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem.

Ke Zhang Xiaoqing Wang Gong Cheng

Published in: WWW (2023)

Keyphrases

approximation algorithms
np hard
special case
vertex cover
worst case
minimum cost
randomized algorithms
facility location problem
primal dual
network design problem
approximation ratio
open shop
approximation schemes
np hardness
constant factor
set cover
precedence constraints
computational complexity