{"id":"https://openalex.org/W2004752601","doi":"https://doi.org/10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","title":"On shortest two-connected Steiner networks with Euclidean distance","display_name":"On shortest two-connected Steiner networks with Euclidean distance","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2004752601","doi":"https://doi.org/10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","mag":"2004752601"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5101962233","display_name":"D. Frank Hsu","orcid":"https://orcid.org/0000-0003-0468-0843"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"D. Frank Hsu","raw_affiliation_strings":["Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923-12 Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923-12 Japan","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050750924","display_name":"Xiao Hu","orcid":"https://orcid.org/0000-0003-1128-4099"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]}],"countries":["CN","JP"],"is_corresponding":true,"raw_author_name":"Xiao-Dong Hu","raw_affiliation_strings":["Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923-12 Japan","Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923\u201012 Japan","Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923-12 Japan","institution_ids":["https://openalex.org/I177738480"]},{"raw_affiliation_string":"Graduate School of Information Science, Japan Advanced Institute of Science and Technology, 15 Asahidai, Tatsunokuchi, Ishikawa, 923\u201012 Japan","institution_ids":["https://openalex.org/I177738480"]},{"raw_affiliation_string":"Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, People's Republic of China","institution_ids":["https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050750924"],"corresponding_institution_ids":["https://openalex.org/I177738480","https://openalex.org/I19820366"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.0914,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85200419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":"2","first_page":"133","last_page":"140"},"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.9932000041007996,"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.9932000041007996,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.955299973487854,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8582117557525635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6842285394668579},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6594749689102173},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.557815432548523},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5235295295715332},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4974422752857208},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.493840754032135},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4643004536628723},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.42301779985427856},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3907485008239746},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3716547191143036},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2195223867893219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1871035099029541},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1793748140335083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15633723139762878}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8582117557525635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6842285394668579},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6594749689102173},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.557815432548523},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5235295295715332},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4974422752857208},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.493840754032135},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4643004536628723},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.42301779985427856},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3907485008239746},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3716547191143036},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2195223867893219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1871035099029541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1793748140335083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15633723139762878},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1585318792","https://openalex.org/W28092394","https://openalex.org/W1957367111"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,113],"consider":[4],"the":[5,9,15,26,32,35,44,47,64,76,79,93,96,103,142,156],"problem":[6,145],"of":[7,23,34,46,63,78,82,95,99,105,168],"constructing":[8],"shortest":[10,36,48,157],"two-connected":[11,37,49,158],"Steiner":[12,38,159],"network":[13,39,51,162],"on":[14,25,40,52,75,92],"Euclidean":[16,27],"plane.":[17],"For":[18],"a":[19,151],"given":[20],"set":[21],"P":[22,41,73,90,106],"points":[24,71,86],"plane,":[28],"let":[29],"l2(P)":[30,57,121],"denote":[31],"length":[33,45],"divided":[42],"by":[43],"spanning":[50,161],"P.":[53],"We":[54,135],"prove":[55],"that":[56,138],"=":[58],"1,":[59],"if":[60],"any":[61],"one":[62,88],"following":[65],"conditions":[66],"is":[67,107],"satisfied:":[68],"(1)":[69],"All":[70],"in":[72,89],"are":[74,91],"sides":[77,94],"convex":[80,97],"hull":[81,98],"P;":[83,100],"(2)":[84],"all":[85],"except":[87],"or":[101],"(3)":[102],"cardinality":[104],"no":[108],"greater":[109],"than":[110],"5.":[111],"Moreover,":[112],"obtain":[114],"general":[115],"lower":[116],"and":[117,160,170],"upper":[118],"bounds":[119],"for":[120,141,154],"as":[122],"follows:":[123],"(\u221a3/2)":[124],"\u2264":[125,129],"inf{l2(P)":[126],"|":[127],"P}":[128],"[(\u221a3":[130],"+":[131,133],"2)/(\u221a3":[132],"6)].":[134],"also":[136],"show":[137],"Christofides'":[139],"heuristic":[140],"traveling":[143],"salesman":[144],"can":[146],"be":[147],"used":[148],"to":[149],"design":[150],"polynomial-time":[152],"algorithm":[153],"finding":[155],"with":[163],"guaranteed":[164],"worst-case":[165],"performance":[166],"ratio":[167],"\u221a3":[169],"3/2;,":[171],"respectively.":[172],"\u00a9":[173],"1998":[174,183],"John":[175],"Wiley":[176],"&":[177],"Sons,":[178],"Inc.":[179],"Networks":[180],"32:":[181],"133\u2013140,":[182]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}