{"id":"https://openalex.org/W4312985837","doi":"https://doi.org/10.14778/3565816.3565834","title":"Approximating probabilistic group steiner trees in graphs","display_name":"Approximating probabilistic group steiner trees in graphs","publication_year":2022,"publication_date":"2022-10-01","ids":{"openalex":"https://openalex.org/W4312985837","doi":"https://doi.org/10.14778/3565816.3565834"},"language":"en","primary_location":{"id":"doi:10.14778/3565816.3565834","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3565816.3565834","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/A5101915851","display_name":"Shuang Yang","orcid":"https://orcid.org/0009-0004-4062-6638"},"institutions":[{"id":"https://openalex.org/I78988378","display_name":"Renmin University of China","ror":"https://ror.org/041pakw92","country_code":"CN","type":"education","lineage":["https://openalex.org/I78988378"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shuang Yang","raw_affiliation_strings":["Renmin University of China"],"affiliations":[{"raw_affiliation_string":"Renmin University of China","institution_ids":["https://openalex.org/I78988378"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101613334","display_name":"Yahui Sun","orcid":"https://orcid.org/0000-0003-3730-8538"},"institutions":[{"id":"https://openalex.org/I78988378","display_name":"Renmin University of China","ror":"https://ror.org/041pakw92","country_code":"CN","type":"education","lineage":["https://openalex.org/I78988378"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yahui Sun","raw_affiliation_strings":["Renmin University of China"],"affiliations":[{"raw_affiliation_string":"Renmin University of China","institution_ids":["https://openalex.org/I78988378"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047469209","display_name":"Jiesong Liu","orcid":"https://orcid.org/0000-0002-8311-020X"},"institutions":[{"id":"https://openalex.org/I78988378","display_name":"Renmin University of China","ror":"https://ror.org/041pakw92","country_code":"CN","type":"education","lineage":["https://openalex.org/I78988378"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiesong Liu","raw_affiliation_strings":["Renmin University of China"],"affiliations":[{"raw_affiliation_string":"Renmin University of China","institution_ids":["https://openalex.org/I78988378"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010903591","display_name":"Xiaokui Xiao","orcid":"https://orcid.org/0000-0003-0914-4580"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xiaokui Xiao","raw_affiliation_strings":["National University of Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100742464","display_name":"Rong-Hua Li","orcid":"https://orcid.org/0009-0003-1153-8906"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong-Hua Li","raw_affiliation_strings":["Beijing Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074858555","display_name":"Zhewei Wei","orcid":"https://orcid.org/0000-0003-3620-5086"},"institutions":[{"id":"https://openalex.org/I78988378","display_name":"Renmin University of China","ror":"https://ror.org/041pakw92","country_code":"CN","type":"education","lineage":["https://openalex.org/I78988378"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhewei Wei","raw_affiliation_strings":["Renmin University of China"],"affiliations":[{"raw_affiliation_string":"Renmin University of China","institution_ids":["https://openalex.org/I78988378"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5101915851"],"corresponding_institution_ids":["https://openalex.org/I78988378"],"apc_list":null,"apc_paid":null,"fwci":0.2977,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53275328,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"2","first_page":"343","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"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.9980000257492065,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7880779504776001},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7110254764556885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6667076349258423},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5981767177581787},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5684555768966675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5665373206138611},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5061306357383728},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4877229630947113},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.482282429933548},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48214074969291687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47729742527008057},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.44475623965263367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39316272735595703},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.270333468914032},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.24856945872306824},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.0839853584766388},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07953700423240662}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7880779504776001},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7110254764556885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6667076349258423},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5981767177581787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5684555768966675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5665373206138611},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5061306357383728},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4877229630947113},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.482282429933548},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48214074969291687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47729742527008057},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44475623965263367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39316272735595703},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.270333468914032},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.24856945872306824},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0839853584766388},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07953700423240662},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3565816.3565834","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3565816.3565834","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1972545488","https://openalex.org/W1980649419","https://openalex.org/W1983305952","https://openalex.org/W1986201860","https://openalex.org/W1994924587","https://openalex.org/W2001743633","https://openalex.org/W2005945380","https://openalex.org/W2016332468","https://openalex.org/W2042502381","https://openalex.org/W2043354831","https://openalex.org/W2044074944","https://openalex.org/W2046522142","https://openalex.org/W2057012490","https://openalex.org/W2057272970","https://openalex.org/W2071050202","https://openalex.org/W2078446440","https://openalex.org/W2096076988","https://openalex.org/W2110037957","https://openalex.org/W2127080177","https://openalex.org/W2138271690","https://openalex.org/W2145604831","https://openalex.org/W2149631228","https://openalex.org/W2150061878","https://openalex.org/W2154161546","https://openalex.org/W2162833734","https://openalex.org/W2171688288","https://openalex.org/W2331798988","https://openalex.org/W2437205707","https://openalex.org/W2604863852","https://openalex.org/W2610052675","https://openalex.org/W2791658191","https://openalex.org/W2948227434","https://openalex.org/W3012211941","https://openalex.org/W3032387886","https://openalex.org/W3142882589","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224","https://openalex.org/W2367195720","https://openalex.org/W3184075718"],"abstract_inverted_index":{"Consider":[0],"an":[1,153],"edge-weighted":[2],"graph,":[3],"and":[4,88,124,150,172,181,183,191,205,215,220],"a":[5,15,25,30,56,82,199,206],"number":[6,147,158],"of":[7,9,17,27,70,93,148,156,159,166],"properties":[8],"interests":[10],"(PoIs).":[11],"Each":[12],"vertex":[13,42,112],"has":[14,198],"probability":[16,23,34,66],"exhibiting":[18,167],"each":[19,62,168],"PoI.":[20,46,169],"The":[21,47,117],"joint":[22,65],"that":[24,35,43,59,67,224],"set":[26,37,69],"vertices":[28,71,160],"exhibits":[29,44,75],"PoI":[31,77],"is":[32,53,78,98,104,115],"the":[33,64,68,90,99,140,146,157,163,225,230],"this":[36,45,73,76,96,102,127,131],"contains":[38],"at":[39],"least":[40],"one":[41],"probabilistic":[48,236],"group":[49,237],"Steiner":[50,238],"tree":[51,57,74,97],"problem":[52,103],"to":[54,179,189],"find":[55],"such":[58],"(i)":[60],"for":[61,106,138,161,234],"PoI,":[63],"in":[72,95,240],"no":[79],"smaller":[80],"than":[81],"threshold":[83,164],"value,":[84],"e.g.":[85],",":[86],"0.97;":[87],"(ii)":[89],"total":[91],"weight":[92],"edges":[94],"minimum.":[100],"Solving":[101],"useful":[105],"mining":[107],"various":[108,241],"graphs":[109],"with":[110,187,210],"uncertain":[111],"properties,":[113],"but":[114],"NP-hard.":[116],"existing":[118],"work":[119,233],"focuses":[120],"on":[121,218],"certain":[122],"cases,":[123],"cannot":[125],"perform":[126],"task.":[128],"To":[129],"meet":[130],"challenge,":[132],"we":[133],"propose":[134],"3":[135,197],"approximation":[136,176,201],"algorithms":[137,227],"solving":[139],"above":[141],"problem.":[142],"Let":[143],"|\u0393|":[144,180,214],"be":[145,152],"PoIs,":[149],"\u03be":[151,190],"upper":[154],"bound":[155],"satisfying":[162],"value":[165],"Algorithms":[170],"1":[171],"2":[173],"have":[174],"tight":[175],"guarantees":[177],"proportional":[178,203],"\u03be,":[182],"exponential":[184],"time":[185,208],"complexities":[186],"respect":[188,211],"|\u0393|,":[192],"respectively.":[193],"In":[194],"comparison,":[195],"Algorithm":[196],"looser":[200],"guarantee":[202],"to,":[204,212],"polynomial":[207],"complexity":[209],"both":[213],"\u03be.":[216],"Experiments":[217],"real":[219],"large":[221],"datasets":[222],"show":[223],"proposed":[226],"considerably":[228],"outperform":[229],"state-of-the-art":[231],"related":[232],"finding":[235],"trees":[239],"cases.":[242]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
