{"id":"https://openalex.org/W2046532265","doi":"https://doi.org/10.1007/s10898-005-6470-0","title":"Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance","display_name":"Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance","publication_year":2006,"publication_date":"2006-03-01","ids":{"openalex":"https://openalex.org/W2046532265","doi":"https://doi.org/10.1007/s10898-005-6470-0","mag":"2046532265"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-005-6470-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-005-6470-0","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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 Global 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/A5030694645","display_name":"Binwu Zhang","orcid":"https://orcid.org/0000-0002-9936-3172"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"education","lineage":["https://openalex.org/I163340411"]},{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Binwu Zhang","raw_affiliation_strings":["Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, China","Department of Mathematics, Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, Hohai University, Changzhou Campus, Changzhou, China","institution_ids":["https://openalex.org/I163340411"]},{"raw_affiliation_string":"Department of Mathematics, Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100442199","display_name":"Jianzhong Zhang","orcid":"https://orcid.org/0000-0001-7056-8206"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Jianzhong Zhang","raw_affiliation_strings":["Department of Mathematics, City University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, City University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100342968","display_name":"Yong He","orcid":"https://orcid.org/0000-0001-6752-1757"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong He","raw_affiliation_strings":["Department of Mathematics, Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100442199"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":2.8742,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.91413232,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"3","first_page":"467","last_page":"474"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9973000288009644,"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/mathematics","display_name":"Mathematics","score":0.8683676719665527},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6818004250526428},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.665490984916687},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6451543569564819},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.631729006767273},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6093302965164185},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5660471320152283},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5287446975708008},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5183182954788208},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4723459482192993},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4552118480205536},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45403429865837097},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4420573115348816},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4418160021305084},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.42302408814430237},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.413274347782135},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38916832208633423},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2262761890888214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22308436036109924},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17139437794685364},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1471574902534485},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.07478305697441101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06768417358398438},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.06252196431159973}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8683676719665527},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6818004250526428},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.665490984916687},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6451543569564819},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.631729006767273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6093302965164185},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5660471320152283},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5287446975708008},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5183182954788208},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4723459482192993},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4552118480205536},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45403429865837097},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4420573115348816},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4418160021305084},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.42302408814430237},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.413274347782135},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38916832208633423},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2262761890888214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22308436036109924},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17139437794685364},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1471574902534485},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.07478305697441101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06768417358398438},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.06252196431159973},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10898-005-6470-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-005-6470-0","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"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 Global Optimization","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":2,"referenced_works":["https://openalex.org/W1979134936","https://openalex.org/W2044926776"],"related_works":["https://openalex.org/W2058332489","https://openalex.org/W3099328339","https://openalex.org/W4308416203","https://openalex.org/W1964611452","https://openalex.org/W1985149601","https://openalex.org/W2112638680","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2048177396","https://openalex.org/W1971863547"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}