Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WWW
/
Paper
Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem.
Ke Zhang
,
Xiaoqing Wang
,
Gong Cheng
Venue
A*
WWW
Year
2023
Proceedings
WWW
DBLP record
conf/www/ZhangW023 ↗
Browse the full
WWW paper archive
.