{"id":"https://openalex.org/W129438447","doi":"https://doi.org/10.1016/0020-0190(94)00173-v","title":"Element perturbation problems of optimum spanning trees with two-parameter objectives","display_name":"Element perturbation problems of optimum spanning trees with two-parameter objectives","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W129438447","doi":"https://doi.org/10.1016/0020-0190(94)00173-v","mag":"129438447"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00173-v","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00173-v","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5110154079","display_name":"Yung-Cheng Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yung-Cheng Chang","raw_affiliation_strings":["Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104039280","display_name":"Lih\u2010Hsing Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Lih-Hsing Hsu","raw_affiliation_strings":["Department of Computer and Information Science, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu, 30050, Taiwan, ROC","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104039280"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03718404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":"1","first_page":"55","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9631999731063843,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9264000058174133,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.9300823211669922},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8100274801254272},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7480642795562744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6078606843948364},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4747845530509949},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4623037874698639},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4548327624797821},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4404793679714203},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41646474599838257},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39199334383010864},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.22175219655036926},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.19924423098564148},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09751495718955994}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.9300823211669922},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8100274801254272},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7480642795562744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6078606843948364},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4747845530509949},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4623037874698639},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4548327624797821},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4404793679714203},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41646474599838257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39199334383010864},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.22175219655036926},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.19924423098564148},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09751495718955994}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)00173-v","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00173-v","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"mag:129438447","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ifip/ifip94-1.html#ChangH94a","pdf_url":null,"source":{"id":"https://openalex.org/S4306418858","display_name":"IFIP Congress","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IFIP Congress","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2009072875","https://openalex.org/W2051836517","https://openalex.org/W2078948975","https://openalex.org/W2095060915","https://openalex.org/W2097674030","https://openalex.org/W2117708188","https://openalex.org/W2118382442","https://openalex.org/W4245095675"],"related_works":["https://openalex.org/W3141326665","https://openalex.org/W3099328339","https://openalex.org/W2496157499","https://openalex.org/W2519759404","https://openalex.org/W3208173532","https://openalex.org/W1595869144","https://openalex.org/W2002489000","https://openalex.org/W2011577667","https://openalex.org/W2058332489","https://openalex.org/W1992843866","https://openalex.org/W167258023","https://openalex.org/W2006750912","https://openalex.org/W175627016","https://openalex.org/W2002985966","https://openalex.org/W168125756","https://openalex.org/W2009938762","https://openalex.org/W2945254485","https://openalex.org/W2373493542","https://openalex.org/W2954226434","https://openalex.org/W2914168686"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}