{"id":"https://openalex.org/W4396757558","doi":"https://doi.org/10.1145/3589334.3645325","title":"A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree Problem","display_name":"A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree Problem","publication_year":2024,"publication_date":"2024-05-08","ids":{"openalex":"https://openalex.org/W4396757558","doi":"https://doi.org/10.1145/3589334.3645325"},"language":"en","primary_location":{"id":"doi:10.1145/3589334.3645325","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589334.3645325","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 2024","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/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":true,"raw_author_name":"Xiaoqing Wang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, 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, Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012507231"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04533881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"312","last_page":"321"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8800855875015259},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7344894409179688},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6445616483688354},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6101778745651245},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4818662106990814},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4590927064418793},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4419439435005188},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.44114699959754944},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.405691534280777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3523504137992859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30233055353164673},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29662203788757324}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8800855875015259},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7344894409179688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6445616483688354},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6101778745651245},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4818662106990814},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4590927064418793},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4419439435005188},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.44114699959754944},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.405691534280777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3523504137992859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30233055353164673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29662203788757324},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3589334.3645325","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589334.3645325","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 2024","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":28,"referenced_works":["https://openalex.org/W1963899113","https://openalex.org/W1972545488","https://openalex.org/W1981585544","https://openalex.org/W1986201860","https://openalex.org/W2005945380","https://openalex.org/W2019876129","https://openalex.org/W2057822545","https://openalex.org/W2162833734","https://openalex.org/W2164756925","https://openalex.org/W2169624745","https://openalex.org/W2295961103","https://openalex.org/W2437205707","https://openalex.org/W2740492458","https://openalex.org/W2744977767","https://openalex.org/W2769557402","https://openalex.org/W2782884306","https://openalex.org/W2798334132","https://openalex.org/W2888634710","https://openalex.org/W2950422288","https://openalex.org/W2953867581","https://openalex.org/W3010336026","https://openalex.org/W3012566266","https://openalex.org/W3046148182","https://openalex.org/W3095073826","https://openalex.org/W3142882589","https://openalex.org/W3154468706","https://openalex.org/W4213052788","https://openalex.org/W4367047277"],"related_works":["https://openalex.org/W1970145791","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688"],"abstract_inverted_index":{"Knowledge":[0],"Graph":[1],"(KG)":[2],"exploration":[3],"helps":[4],"Web":[5],"users":[6],"understand":[7],"the":[8,59,121,124,133],"contents":[9],"of":[10,82,116,123,129],"a":[11,27,37,67,86,95,114,138,141],"large":[12,49],"and":[13,16,77],"unfamiliar":[14],"KG":[15],"extract":[17],"relevant":[18],"insights.":[19],"The":[20],"task":[21],"has":[22],"recently":[23],"been":[24],"formulated":[25],"as":[26],"Quadratic":[28],"Group":[29],"Steiner":[30],"Tree":[31],"Problem":[32],"(QGSTP)":[33],"to":[34,85,94,105,148],"search":[35],"for":[36,53,71,136],"semantically":[38],"cohesive":[39],"subgraph":[40],"connecting":[41],"entities":[42],"that":[43],"match":[44],"query":[45,139],"keywords.":[46],"However,":[47],"on":[48,140],"graphs,":[50],"existing":[51],"algorithms":[52],"this":[54,63],"NP-hard":[55],"problem":[56],"cannot":[57],"meet":[58],"performance":[60],"need.":[61],"In":[62],"paper,":[64],"we":[65],"propose":[66],"novel":[68],"approximation":[69,97],"algorithm":[70],"QGSTP":[72],"called":[73],"HB.":[74],"It":[75],"finds":[76],"merges":[78],"an":[79],"optimal":[80],"set":[81,115],"paths":[83,104],"according":[84],"Hop-Biased":[87],"objective":[88],"function,":[89],"which":[90],"not":[91],"only":[92],"leads":[93],"guaranteed":[96],"ratio":[98],"but":[99],"is":[100],"also":[101],"decomposable":[102],"by":[103,113,126],"enable":[106],"efficient":[107],"dynamic":[108],"programming":[109],"based":[110],"search.":[111],"Accompanied":[112],"pruning":[117],"heuristics,":[118],"HB":[119],"outperformed":[120],"state":[122],"art":[125],"1-2":[127],"orders":[128],"magnitude,":[130],"empirically":[131],"reducing":[132],"average":[134],"time":[135],"answering":[137],"million-scale":[142],"graph":[143],"from":[144],"about":[145],"one":[146,149],"minute":[147],"second.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}