{"id":"https://openalex.org/W2724243857","doi":"https://doi.org/10.1109/icis.2017.7959970","title":"The restricted minimum single source shortest path tree expansion problem","display_name":"The restricted minimum single source shortest path tree expansion problem","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2724243857","doi":"https://doi.org/10.1109/icis.2017.7959970","mag":"2724243857"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2017.7959970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2017.7959970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","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/A5100354466","display_name":"Haiyan Wang","orcid":"https://orcid.org/0000-0003-1053-587X"},"institutions":[{"id":"https://openalex.org/I49185572","display_name":"Yunnan University of Finance And Economics","ror":"https://ror.org/04rhev598","country_code":"CN","type":"education","lineage":["https://openalex.org/I49185572"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Haiyan Wang","raw_affiliation_strings":["School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, China"],"affiliations":[{"raw_affiliation_string":"School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, China","institution_ids":["https://openalex.org/I49185572"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074988809","display_name":"Wei-Qi Deng","orcid":"https://orcid.org/0000-0002-5130-4181"},"institutions":[{"id":"https://openalex.org/I49185572","display_name":"Yunnan University of Finance And Economics","ror":"https://ror.org/04rhev598","country_code":"CN","type":"education","lineage":["https://openalex.org/I49185572"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weiqi Deng","raw_affiliation_strings":["School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, China"],"affiliations":[{"raw_affiliation_string":"School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, China","institution_ids":["https://openalex.org/I49185572"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100899236","display_name":"Binchao Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I180662265","display_name":"China Mobile (China)","ror":"https://ror.org/05gftfe97","country_code":"CN","type":"company","lineage":["https://openalex.org/I180662265"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Binchao Huang","raw_affiliation_strings":["China Mobile Group Yunnan Co., Ltd., Kunming, China"],"affiliations":[{"raw_affiliation_string":"China Mobile Group Yunnan Co., Ltd., Kunming, China","institution_ids":["https://openalex.org/I180662265"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018144399","display_name":"Jianping Li","orcid":"https://orcid.org/0000-0003-1508-1440"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianping Li","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming, China","institution_ids":["https://openalex.org/I189210763"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100354466"],"corresponding_institution_ids":["https://openalex.org/I49185572"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10646762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"63","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9275000095367432,"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/combinatorics","display_name":"Combinatorics","score":0.6959221363067627},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6870046854019165},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5259642601013184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5024716854095459},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.500960111618042},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.49225321412086487},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4757102131843567},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4511234164237976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3874526619911194},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38064002990722656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30764639377593994},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.17399293184280396},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16757464408874512}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6959221363067627},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6870046854019165},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5259642601013184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5024716854095459},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.500960111618042},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.49225321412086487},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4757102131843567},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4511234164237976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3874526619911194},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38064002990722656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30764639377593994},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.17399293184280396},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16757464408874512}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2017.7959970","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2017.7959970","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1977545325","https://openalex.org/W2011039300","https://openalex.org/W2020532780","https://openalex.org/W2053913299","https://openalex.org/W2061159212","https://openalex.org/W2069323107","https://openalex.org/W2122506411","https://openalex.org/W2169528473","https://openalex.org/W2611804663","https://openalex.org/W4213060235","https://openalex.org/W4249318479"],"related_works":["https://openalex.org/W4206588173","https://openalex.org/W2003809182","https://openalex.org/W2103613456","https://openalex.org/W1980494375","https://openalex.org/W2358754422","https://openalex.org/W2016824557","https://openalex.org/W2111672462","https://openalex.org/W1995374889","https://openalex.org/W2282234940","https://openalex.org/W1586038047"],"abstract_inverted_index":{"We":[0,226,378],"consider":[1],"three":[2],"kinds":[3],"of":[4,40,47,59,75,95,118,134,210,316,362],"minimum":[5,231,297,320,384],"single":[6,232,298,321,340,385],"source":[7,233,299,322,341,386],"shortest":[8,234,300,323,342,387],"path":[9,235,301,324,343,388],"tree":[10,132,236,302,325,344,389],"expansion":[11,237,303,326,390],"problems.":[12],"Given":[13],"an":[14],"undirected":[15],"connected":[16],"graph":[17],"G":[18],"=":[19,81,104,127],"(V,":[20],"E;":[21],"w,":[22],"c,":[23],"b;":[24],"s)":[25],"with":[26,334],"n":[27],"vertexes,":[28],"m":[29],"edges":[30,213,365],"and":[31,69,98,121,197,243,305],"a":[32,64,72,130,246,307,330,335,339,354,394],"positive":[33],"constant":[34],"H,":[35,89,112],"w(e)":[36],"is":[37,44,51,63,71,102,125,171,186,203,241,368],"the":[38,45,52,57,93,99,116,122,172,187,206,212,229,259,291,294,314,317,358,364,381],"length":[39],"edge":[41,48,60,79,96,119],"e,":[42,49,61],"c(e)":[43],"capacity":[46,58,66,86,94,109,117],"b(e)":[50],"unit":[53],"cost":[54,209,361],"to":[55,176,191,204],"increase":[56,92,115],"H":[62,105],"given":[65],"restriction":[67],"value":[68,101,124],"s":[70,175,190],"fixed":[73],"vertex":[74,285],"G.":[76],"For":[77],"every":[78,160,284],"e":[80],"uv":[82],"\u2208":[83,162,287,351],"E,":[84],"if":[85,108],"c(uv)":[87,110],"<;":[88],"we":[90,113,244,289,328],"should":[91],"uv,":[97,120],"increasing":[100,123],"add(uv)":[103,126],"-":[106],"c(uv);":[107],"\u2265":[111,157,281],"needn't":[114],"0.":[128],"Find":[129],"spanning":[131],"T":[133,345,367],"G,":[135,194],"such":[136,356],"that":[137,216,357,370],"d":[138,147,165,180,262,271],"<sub":[139,148,166,181,219,263,272,373],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[140,149,167,182,220,264,273,374],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">T</sub>":[141,168,265],"(s,":[142,151,169,184,266,275],"v)":[143,152,170,185,267,276],"\u2264":[144,268],"\u03b1":[145,196,252,269],"\u00b7":[146,224,270],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</sub>":[150,183,274],"+":[153,277],"\u03b2":[154,156,198,255,278,280],"(\u03b1,":[155,279],"0)":[158,282],"for":[159,249,283,311,397],"v":[161,286,350],"V,":[163,288],"here,":[164],"distance":[173,188],"from":[174,189],"t":[177,192],"in":[178,193,214,258,366],"T,":[179,215],"both":[195],"are":[199],"constants.":[200],"The":[201,239],"objective":[202],"minimize":[205],"total":[207,359],"expanding":[208,360],"all":[211,363],"is,":[217,371],"min":[218,372],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">e\u2208E(T)</sub>":[221,375],"\u03a3":[222,376],"add(e)":[223],"b(e).":[225],"call":[227,290,379],"it":[228,380],"restricted":[230,296,319,383],"problem.":[238],"problem":[240,293,304,333],"NP-hard,":[242],"design":[245,306,393],"heuristic":[247],"algorithm":[248,310,396],"it.":[250,312,398],"Suppose":[251],"\u2261":[253,256],"1,":[254],"0":[257],"constraint":[260],"condition":[261],"new":[292],"extended":[295,318],"strongly":[308],"polynomial-time":[309,395],"On":[313],"basis":[315],"problem,":[327,391],"study":[329],"more":[331],"widespread":[332],"different":[336],"objective:":[337],"find":[338],"(we":[346],"can":[347],"use":[348],"any":[349],"V":[352],"as":[353],"root),":[355],"minimum,":[369],"add(e)\u00b7b(e).":[377],"general":[382],"then":[392]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}