乐胖代购免代理版

{"id":"https://openalex.org/W2157338118","doi":"https://doi.org/10.1109/sfcs.1991.185402","title":"On better heuristic for Euclidean Steiner minimum trees","display_name":"On better heuristic for Euclidean Steiner minimum trees","publication_year":2002,"publication_date":"2002-12-09","ids":{"openalex":"https://openalex.org/W2157338118","doi":"https://doi.org/10.1109/sfcs.1991.185402","mag":"2157338118"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1991.185402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5037860988","display_name":"Ding\u2010Zhu Du","orcid":"https://orcid.org/0000-0002-7345-2185"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.-Z. Du","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, USA","Institute of Applied Mathematics, Chinese Academy and Sciences, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy and Sciences, Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027034164","display_name":"Y. Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Zhang","raw_affiliation_strings":["Computer Science Department, Southern Methodist University, Dallas, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Southern Methodist University, Dallas, USA","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100695390","display_name":"Feng Qi","orcid":"https://orcid.org/0000-0001-6239-2968"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Q. Feng","raw_affiliation_strings":["Department of Civil Engineering and Operations Research, Princeton University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering and Operations Research, Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.984,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":50,"citation_normalized_percentile":{"value":0.920612,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"431","last_page":"439"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997,"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.9997,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9996,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9941,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.91267264},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43623102},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.4262416},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.41369575}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.91267264},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7282064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.71934414},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6454098},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6025758},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5533863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.480926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4379336},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43623102},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43473828},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.4262416},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42123768},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.41369575},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4118952},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32744753},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19094688},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.14011559},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.1101726},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.09808993},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1991.185402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":14,"referenced_works":["https://openalex.org/W1961822357","https://openalex.org/W1975442866","https://openalex.org/W1995157426","https://openalex.org/W2024513878","https://openalex.org/W2025949472","https://openalex.org/W2027573422","https://openalex.org/W2028803498","https://openalex.org/W2060380213","https://openalex.org/W2069712919","https://openalex.org/W2085655777","https://openalex.org/W2086709935","https://openalex.org/W2087675574","https://openalex.org/W2094076885","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W4318676427","https://openalex.org/W4286959400","https://openalex.org/W3201893458","https://openalex.org/W2103696587","https://openalex.org/W2090152127","https://openalex.org/W2081066931","https://openalex.org/W2080581853","https://openalex.org/W2049375542","https://openalex.org/W2011703460","https://openalex.org/W1992380975"],"abstract_inverted_index":{"Finding":[0],"a":[1,5,29,33],"shortest":[2],"network":[3],"interconnecting":[4],"given":[6],"set":[7],"of":[8],"points":[9],"in":[10],"the":[11],"Euclidean":[12],"plane":[13],"(a":[14],"Steiner":[15],"minimum":[16],"tree)":[17],"is":[18,24],"known":[19],"to":[20],"be":[21],"NP-hard.":[22],"It":[23],"shown":[25],"that":[26],"there":[27],"exists":[28],"polynomial-time":[30],"heuristic":[31],"with":[32],"performance":[34],"ratio":[35],"bigger":[36],"than":[37],"square":[38],"root":[39],"3/2.<":[40],">":[43]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2157338118","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-09T10:18:44.776258","created_date":"2016-06-24"}