{"id":"https://openalex.org/W4367047277","doi":"https://doi.org/10.1145/3543507.3583257","title":"Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem","display_name":"Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem","publication_year":2023,"publication_date":"2023-04-26","ids":{"openalex":"https://openalex.org/W4367047277","doi":"https://doi.org/10.1145/3543507.3583257"},"language":"en","primary_location":{"id":"doi:10.1145/3543507.3583257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543507.3583257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2023","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040751681","display_name":"Ke Zhang","orcid":"https://orcid.org/0000-0002-0628-0416"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ke Zhang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012507231","display_name":"Xiaoqing Wang","orcid":"https://orcid.org/0000-0001-8198-8847"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoqing Wang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063617509","display_name":"Gong Cheng","orcid":"https://orcid.org/0000-0003-3539-7776"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gong Cheng","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040751681"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":1.0166,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74638543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9378381371498108},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7126016616821289},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6865783929824829},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6847866773605347},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5353622436523438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5165490508079529},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.5161117315292358},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5108063220977783},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4263922870159149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41595956683158875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4070820212364197},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.379456102848053},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24028316140174866},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.19900652766227722}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9378381371498108},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7126016616821289},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6865783929824829},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6847866773605347},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5353622436523438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5165490508079529},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.5161117315292358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5108063220977783},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4263922870159149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41595956683158875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4070820212364197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.379456102848053},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24028316140174866},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.19900652766227722},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3543507.3583257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3543507.3583257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Web Conference 2023","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1972545488","https://openalex.org/W2005945380","https://openalex.org/W2008229997","https://openalex.org/W2019003829","https://openalex.org/W2026902273","https://openalex.org/W2034112563","https://openalex.org/W2084822306","https://openalex.org/W2135408592","https://openalex.org/W2162833734","https://openalex.org/W2295961103","https://openalex.org/W2402803841","https://openalex.org/W2437205707","https://openalex.org/W2521527642","https://openalex.org/W2740492458","https://openalex.org/W2744977767","https://openalex.org/W2769557402","https://openalex.org/W2974923787","https://openalex.org/W3010336026","https://openalex.org/W3012566266","https://openalex.org/W3095073826","https://openalex.org/W3142882589","https://openalex.org/W3154468706","https://openalex.org/W3178892021","https://openalex.org/W3202929521","https://openalex.org/W4206908526","https://openalex.org/W4213052788"],"related_works":["https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224","https://openalex.org/W2367195720","https://openalex.org/W3184075718"],"abstract_inverted_index":{"The":[0],"Diameter-bounded":[1],"max-Coverage":[2],"Group":[3,51],"Steiner":[4,52],"Tree":[5,53],"(DCGST)":[6],"problem":[7,55,64],"has":[8,41,57],"recently":[9],"been":[10,58],"proposed":[11],"as":[12],"an":[13,67,104],"expressive":[14],"way":[15],"of":[16,22,38,121],"formulating":[17],"keyword-based":[18],"search":[19,96],"and":[20,40,84,113,119],"exploration":[21],"knowledge":[23],"graphs.":[24],"It":[25],"aims":[26],"at":[27],"finding":[28],"a":[29,94],"diameter-bounded":[30],"tree":[31],"which":[32,56],"covers":[33],"the":[34,42,61,76,81,117],"most":[35],"given":[36],"groups":[37],"vertices":[39],"minimum":[43],"weight.":[44],"In":[45,70],"contrast":[46],"to":[47],"its":[48,87],"specialization\u2014the":[49],"classic":[50],"(GST)":[54],"extensively":[59],"studied,":[60],"emerging":[62],"DCGST":[63,82],"still":[65],"lacks":[66],"efficient":[68],"algorithm.":[69,107],"this":[71],"paper,":[72],"we":[73,85,92],"propose":[74],"Cba,":[75],"first":[77],"approximation":[78,89,106],"algorithm":[79],"for":[80],"problem,":[83],"prove":[86],"worst-case":[88],"ratio.":[90],"Furthermore,":[91],"incorporate":[93],"best-first":[95],"strategy":[97],"with":[98],"two":[99],"pruning":[100],"methods":[101],"into":[102],"PrunedCBA,":[103],"improved":[105],"Our":[108],"extensive":[109],"experiments":[110],"on":[111],"real":[112],"synthetic":[114],"graphs":[115],"demonstrate":[116],"effectiveness":[118],"efficiency":[120],"PrunedCBA.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}