{"id":"https://openalex.org/W2103696587","doi":"https://doi.org/10.1109/icpads.2007.4447726","title":"Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs","display_name":"Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2103696587","doi":"https://doi.org/10.1109/icpads.2007.4447726","mag":"2103696587"},"language":"en","primary_location":{"id":"doi:10.1109/icpads.2007.4447726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2007.4447726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Parallel and Distributed Systems","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"H. Akbari","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Akbari","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065364201","display_name":"Zeinab Iranmanesh","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Z. Iranmanesh","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105710652","display_name":"Mohammad Ghodsi","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Ghodsi","raw_affiliation_strings":["IPM school of Computer Science, Tehran, Iran","Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IPM school of Computer Science, Tehran, Iran","institution_ids":[]},{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I133529467"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.20274126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"8"},"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.9897000193595886,"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.9897000193595886,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.984499990940094,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.9837999939918518,"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.9273070096969604},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7868945002555847},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6534345149993896},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6419626474380493},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6059215664863586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.566722571849823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4739919900894165},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4577237069606781},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42628124356269836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3335530459880829},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.22574248909950256},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1621313989162445},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.13102924823760986},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.0815025269985199}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9273070096969604},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7868945002555847},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6534345149993896},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6419626474380493},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6059215664863586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.566722571849823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4739919900894165},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4577237069606781},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42628124356269836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3335530459880829},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.22574248909950256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1621313989162445},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.13102924823760986},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0815025269985199}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpads.2007.4447726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2007.4447726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Parallel and Distributed Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.110.7871","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.7871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sharif.edu/~ghodsi/papers/icpads2007.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1483673511","https://openalex.org/W1533433314","https://openalex.org/W1566364654","https://openalex.org/W1574192818","https://openalex.org/W1591905644","https://openalex.org/W1970760181","https://openalex.org/W1979489783","https://openalex.org/W1980288485","https://openalex.org/W1990327548","https://openalex.org/W1995516408","https://openalex.org/W1998126097","https://openalex.org/W2020398978","https://openalex.org/W2021209233","https://openalex.org/W2031167811","https://openalex.org/W2056204644","https://openalex.org/W2058299682","https://openalex.org/W2097755092","https://openalex.org/W2113202247","https://openalex.org/W2519937069","https://openalex.org/W2532410343","https://openalex.org/W6631693233","https://openalex.org/W6647811010","https://openalex.org/W6727108866"],"related_works":["https://openalex.org/W4308416203","https://openalex.org/W2518240130","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W4295683043","https://openalex.org/W2048177396","https://openalex.org/W2943635264","https://openalex.org/W620960161","https://openalex.org/W3099328339","https://openalex.org/W2099915933"],"abstract_inverted_index":{"Given":[0],"an":[1],"undirected":[2],"graph":[3],"with":[4,7,102],"weights":[5],"associated":[6],"its":[8,84],"edges,":[9],"the":[10,29,42,57,93],"Steiner":[11,43,58],"tree":[12],"problem":[13,44,59],"consists":[14],"of":[15,25,28,69,75],"finding":[16],"a":[17,22,38,65],"minimum":[18],"weight":[19],"subtree":[20],"spanning":[21],"given":[23],"subset":[24],"(terminal)":[26],"nodes":[27],"original":[30],"graph.":[31],"Minimum":[32],"Spanning":[33],"Tree":[34],"Heuristic":[35],"(MSTH)":[36],"is":[37,97,100],"heuristic":[39],"for":[40,55],"solving":[41,56],"in":[45,60],"graphs.":[46,61],"In":[47],"this":[48],"paper":[49],"we":[50],"first":[51],"review":[52],"existing":[53,104],"algorithms":[54],"We":[62,78],"then":[63],"introduce":[64],"new":[66],"parallel":[67,105],"version":[68],"MSTH":[70],"on":[71],"three":[72],"dimensional":[73],"mesh":[74],"trees":[76],"architecture.":[77],"describe":[79],"our":[80],"algorithm":[81],"and":[82],"analyze":[83],"time":[85,88,96],"complexity.":[86],"The":[87],"complexity":[89],"analysis":[90],"shows":[91],"that":[92],"algorithm\u2019s":[94],"running":[95],"O(lg2n)":[98],"which":[99],"comparable":[101],"other":[103],"solutions.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}