{"id":"https://openalex.org/W7139074413","doi":"https://doi.org/10.3390/a19030232","title":"Steiner Tree Approximations in Graphs and Hypergraphs","display_name":"Steiner Tree Approximations in Graphs and Hypergraphs","publication_year":2026,"publication_date":"2026-03-19","ids":{"openalex":"https://openalex.org/W7139074413","doi":"https://doi.org/10.3390/a19030232"},"language":"en","primary_location":{"id":"doi:10.3390/a19030232","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19030232","pdf_url":"https://www.mdpi.com/1999-4893/19/3/232/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/19/3/232/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022454961","display_name":"Mikl\u00f3s Moln\u00e1r","orcid":"https://orcid.org/0000-0003-1345-4792"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mikl\u00f3s Moln\u00e1r","raw_affiliation_strings":["Laboratoire d\u2019Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier (LIRMM), University of Montpellier, Centre National de la Recherche Scientifique (CNRS), 161 Rue Ada, 34095 Montpellier Cedex 5, France"],"raw_orcid":"https://orcid.org/0000-0003-1345-4792","affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier (LIRMM), University of Montpellier, Centre National de la Recherche Scientifique (CNRS), 161 Rue Ada, 34095 Montpellier Cedex 5, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129977375","display_name":"Basma Mostafa Hassan","orcid":null},"institutions":[{"id":"https://openalex.org/I126427551","display_name":"Damietta University","ror":"https://ror.org/035h3r191","country_code":"EG","type":"education","lineage":["https://openalex.org/I126427551"]},{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Basma Mostafa Hassan","raw_affiliation_strings":["Faculty of Artificial Intelligence & Informatics, Horus University, New Damietta 34518, Egypt","Operations Research Department, Faculty of Computers & Artificial Intelligence, Cairo University, Giza 12613, Egypt"],"raw_orcid":"https://orcid.org/0000-0001-7802-3681","affiliations":[{"raw_affiliation_string":"Faculty of Artificial Intelligence & Informatics, Horus University, New Damietta 34518, Egypt","institution_ids":["https://openalex.org/I126427551"]},{"raw_affiliation_string":"Operations Research Department, Faculty of Computers & Artificial Intelligence, Cairo University, Giza 12613, Egypt","institution_ids":["https://openalex.org/I145487455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022454961"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101743"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60962386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"3","first_page":"232","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.46219998598098755,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.46219998598098755,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.211899995803833,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.0778999999165535,"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.9075000286102295},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5755000114440918},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4934000074863434},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.487199991941452},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.478300005197525},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.459199994802475},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4564000070095062},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44679999351501465},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44209998846054077}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9075000286102295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6129000186920166},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5755000114440918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5178999900817871},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4934000074863434},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.487199991941452},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.459199994802475},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44679999351501465},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4325999915599823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4293999969959259},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.41100001335144043},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4004000127315521},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.3384999930858612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31869998574256897},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3140999972820282},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.2797999978065491},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26739999651908875},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25429999828338623},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19030232","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19030232","pdf_url":"https://www.mdpi.com/1999-4893/19/3/232/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8b410e52f68e440db4e5d9bc4b7ea143","is_oa":true,"landing_page_url":"https://doaj.org/article/8b410e52f68e440db4e5d9bc4b7ea143","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 3, p 232 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19030232","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19030232","pdf_url":"https://www.mdpi.com/1999-4893/19/3/232/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7139074413.pdf","grobid_xml":"https://content.openalex.org/works/W7139074413.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1185775471","https://openalex.org/W1529709047","https://openalex.org/W1534139723","https://openalex.org/W1965680834","https://openalex.org/W1975290397","https://openalex.org/W1979269423","https://openalex.org/W1991055327","https://openalex.org/W1998126097","https://openalex.org/W2017927472","https://openalex.org/W2039298646","https://openalex.org/W2044176843","https://openalex.org/W2157338118","https://openalex.org/W3106892521","https://openalex.org/W4239626474","https://openalex.org/W4408413924","https://openalex.org/W4414091455","https://openalex.org/W4416236134"],"related_works":[],"abstract_inverted_index":{"The":[0,53,66],"construction":[1],"of":[2,15],"partial":[3],"minimum":[4,41],"spanning":[5],"trees":[6,76,81],"is":[7],"an":[8,35],"NP-hard":[9],"problem,":[10],"leading":[11],"to":[12,28,71,114],"the":[13,40,47,108],"development":[14],"various":[16],"heuristic":[17],"algorithms.":[18],"Existing":[19],"heuristics,":[20],"including":[21],"Kruskal\u2019s":[22],"algorithm,":[23],"frequently":[24],"employ":[25],"shortest":[26],"paths":[27],"connect":[29],"tree":[30,111],"components.":[31],"This":[32],"study":[33],"introduces":[34],"approximate":[36,107],"algorithm":[37,67],"for":[38,50],"constructing":[39],"Steiner":[42,75,110],"tree,":[43],"which":[44],"serves":[45],"as":[46],"optimal":[48,109],"structure":[49],"diffusion":[51],"multicast.":[52],"proposed":[54],"approach":[55],"utilizes":[56],"graph-based":[57],"structures":[58],"that":[59,98,104],"provide":[60],"advantages":[61],"over":[62],"conventional":[63],"shortest-path":[64],"methods.":[65],"incorporates":[68],"connections":[69],"analogous":[70],"those":[72],"in":[73],"simple":[74,80],"when":[77],"required.":[78],"These":[79],"are":[82],"represented":[83],"by":[84],"hyperedges,":[85],"and":[86,125],"a":[87,119],"Hyper":[88],"Metric":[89],"Closure":[90],"can":[91],"also":[92],"be":[93],"applied.":[94],"Experimental":[95],"results":[96],"indicate":[97],"this":[99],"hypergraph-based":[100],"method":[101],"enables":[102],"constructions":[103],"more":[105],"closely":[106],"cost":[112],"compared":[113],"traditional":[115],"pairwise":[116],"techniques,":[117],"offering":[118],"scalable":[120],"balance":[121],"between":[122],"computational":[123],"complexity":[124],"routing":[126],"efficiency.":[127]},"counts_by_year":[],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2026-03-20T00:00:00"}