{"id":"https://openalex.org/W3087800571","doi":"https://doi.org/10.1007/s10878-020-00656-3","title":"Partial inverse min\u2013max spanning tree problem","display_name":"Partial inverse min\u2013max spanning tree problem","publication_year":2020,"publication_date":"2020-09-27","ids":{"openalex":"https://openalex.org/W3087800571","doi":"https://doi.org/10.1007/s10878-020-00656-3","mag":"3087800571"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-020-00656-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-020-00656-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5047879098","display_name":"Javad Tayyebi","orcid":"https://orcid.org/0000-0002-7559-3870"},"institutions":[{"id":"https://openalex.org/I97626857","display_name":"University of Birjand","ror":"https://ror.org/03g4hym73","country_code":"IR","type":"education","lineage":["https://openalex.org/I97626857"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Javad Tayyebi","raw_affiliation_strings":["Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran"],"raw_orcid":"https://orcid.org/0000-0002-7559-3870","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran","institution_ids":["https://openalex.org/I97626857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035498296","display_name":"Ali Reza Sepasian","orcid":"https://orcid.org/0000-0002-6655-7480"},"institutions":[{"id":"https://openalex.org/I4210161235","display_name":"Fasa University of Medical Sciences","ror":"https://ror.org/05bh0zx16","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210161235"]},{"id":"https://openalex.org/I4400600978","display_name":"Fasa University","ror":"https://ror.org/03a77cf20","country_code":null,"type":"education","lineage":["https://openalex.org/I4400600978"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Ali Reza Sepasian","raw_affiliation_strings":["Department of Mathematics, Fasa University, Fasa, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Fasa University, Fasa, Iran","institution_ids":["https://openalex.org/I4210161235","https://openalex.org/I4400600978"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035498296","https://openalex.org/A5047879098"],"corresponding_institution_ids":["https://openalex.org/I4210161235","https://openalex.org/I4400600978","https://openalex.org/I97626857"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":0.5997,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.65249714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"4","first_page":"1075","last_page":"1091"},"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.9904000163078308,"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.9904000163078308,"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.989799976348877,"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/T14304","display_name":"Transport Systems and Technology","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7788877487182617},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.747398853302002},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6511131525039673},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6384074091911316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6235100626945496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6147278547286987},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5536268949508667},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.49715426564216614},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4960514008998871},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4415208697319031},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4409993588924408},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.424007385969162},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4223533868789673},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.42216983437538147},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.40141141414642334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35647425055503845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2704085409641266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24387872219085693},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.21469047665596008},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14901208877563477}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7788877487182617},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.747398853302002},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6511131525039673},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6384074091911316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6235100626945496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6147278547286987},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5536268949508667},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.49715426564216614},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4960514008998871},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4415208697319031},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4409993588924408},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.424007385969162},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4223533868789673},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.42216983437538147},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.40141141414642334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35647425055503845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2704085409641266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24387872219085693},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.21469047665596008},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14901208877563477},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded 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":2,"locations":[{"id":"doi:10.1007/s10878-020-00656-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-020-00656-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00656-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-020-00656-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W58614044","https://openalex.org/W1486993561","https://openalex.org/W1503010356","https://openalex.org/W1512208174","https://openalex.org/W1965702747","https://openalex.org/W1968182342","https://openalex.org/W1971863547","https://openalex.org/W1977545325","https://openalex.org/W1979134936","https://openalex.org/W2007619042","https://openalex.org/W2015317001","https://openalex.org/W2018804864","https://openalex.org/W2027482741","https://openalex.org/W2044926776","https://openalex.org/W2046532265","https://openalex.org/W2057801831","https://openalex.org/W2077423331","https://openalex.org/W2125035701","https://openalex.org/W2137212783","https://openalex.org/W2138865117","https://openalex.org/W2159190587","https://openalex.org/W2177711438","https://openalex.org/W2693076760","https://openalex.org/W2748800470","https://openalex.org/W2794469634","https://openalex.org/W2797311821","https://openalex.org/W2911796152","https://openalex.org/W2946857491","https://openalex.org/W2964052424","https://openalex.org/W3121913816","https://openalex.org/W3142570770","https://openalex.org/W3143219376"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W193918669","https://openalex.org/W1978034843","https://openalex.org/W1997570556","https://openalex.org/W2092979316","https://openalex.org/W1576317141","https://openalex.org/W130518292","https://openalex.org/W2408068853","https://openalex.org/W2911818503","https://openalex.org/W1754127855"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}