{"id":"https://openalex.org/W1982174735","doi":"https://doi.org/10.4304/jmm.9.4.522-526","title":"Fast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem","display_name":"Fast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem","publication_year":2014,"publication_date":"2014-04-08","ids":{"openalex":"https://openalex.org/W1982174735","doi":"https://doi.org/10.4304/jmm.9.4.522-526","mag":"1982174735"},"language":"en","primary_location":{"id":"doi:10.4304/jmm.9.4.522-526","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jmm.9.4.522-526","pdf_url":null,"source":{"id":"https://openalex.org/S16006927","display_name":"Journal of Multimedia","issn_l":"1796-2048","issn":["1796-2048"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Multimedia","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/A5073653065","display_name":"Zimao Li","orcid":null},"institutions":[{"id":"https://openalex.org/I174442536","display_name":"South Central Minzu University","ror":"https://ror.org/03d7sax13","country_code":"CN","type":"education","lineage":["https://openalex.org/I174442536"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zimao Li","raw_affiliation_strings":["College of Computer Science, South-Central University for Nationalities, Wuhan City, Hubei Province"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, South-Central University for Nationalities, Wuhan City, Hubei Province","institution_ids":["https://openalex.org/I174442536"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012039752","display_name":"Wenying Xiao","orcid":null},"institutions":[{"id":"https://openalex.org/I174442536","display_name":"South Central Minzu University","ror":"https://ror.org/03d7sax13","country_code":"CN","type":"education","lineage":["https://openalex.org/I174442536"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenying Xiao","raw_affiliation_strings":["College of Computer Science, South-Central University for Nationalities, Wuhan City, Hubei Province"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computer Science, South-Central University for Nationalities, Wuhan City, Hubei Province","institution_ids":["https://openalex.org/I174442536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174442536"],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65759602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":"4","first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9359415769577026},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7950702905654907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6919376254081726},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5677746534347534},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4996378421783447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49712660908699036},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4782887101173401},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.45275992155075073},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.42847955226898193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38982754945755005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.379086971282959},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.3563283085823059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2772294878959656},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21391969919204712},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.09773486852645874}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9359415769577026},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7950702905654907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6919376254081726},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5677746534347534},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4996378421783447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49712660908699036},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4782887101173401},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.45275992155075073},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.42847955226898193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38982754945755005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.379086971282959},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3563283085823059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2772294878959656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21391969919204712},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.09773486852645874},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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.4304/jmm.9.4.522-526","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jmm.9.4.522-526","pdf_url":null,"source":{"id":"https://openalex.org/S16006927","display_name":"Journal of Multimedia","issn_l":"1796-2048","issn":["1796-2048"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Multimedia","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W1503036335","https://openalex.org/W1578824783","https://openalex.org/W1919263559","https://openalex.org/W2011039300","https://openalex.org/W2047386086","https://openalex.org/W2060380213","https://openalex.org/W2069002708","https://openalex.org/W2070664846","https://openalex.org/W2148678019","https://openalex.org/W2159715164","https://openalex.org/W2161071733","https://openalex.org/W2165112989","https://openalex.org/W2166942785","https://openalex.org/W2171603211","https://openalex.org/W2476096155","https://openalex.org/W4246219036","https://openalex.org/W4248275387","https://openalex.org/W6602249631","https://openalex.org/W6610072603"],"related_works":["https://openalex.org/W1982174735","https://openalex.org/W4230236037","https://openalex.org/W278944754","https://openalex.org/W4287644684","https://openalex.org/W3092594390","https://openalex.org/W2230142518","https://openalex.org/W1702576938","https://openalex.org/W2066194644","https://openalex.org/W4252672097","https://openalex.org/W2122930867"],"abstract_inverted_index":{"Bottleneck":[0],"Steiner":[1,8,21,58,70],"tree":[2,9,33,59],"problem":[3,37,60,84],"asks":[4],"to":[5],"find":[6],"a":[7,52,96],"for":[10],"n":[12],"terminals":[14],"with":[15,103],"at":[16],"most":[17],"k":[19],"points":[22,71],"such":[23],"that":[24,67,82],"the":[25,28,32,41,56,62,76,83],"length":[26],"of":[27,43,55],"longest":[29],"edge":[30],"in":[31,40,61,75],"is":[34,85],"minimized.":[35],"The":[36],"has":[38],"applications":[39],"design":[42],"wireless":[44],"communication":[45],"networks.":[46],"In":[47],"this":[48],"paper":[49],"we":[50],"study":[51],"restricted":[53],"version":[54],"bottleneck":[57],"Euclidean":[63],"plane":[64],"which":[65],"requires":[66],"only":[68],"degree-2":[69],"are":[72],"possibly":[73],"adjacent":[74],"optimal":[77],"solution.":[78],"We":[79],"first":[80],"show":[81],"NP-hard":[86],"and":[87,94],"cannot":[88],"be":[89],"approximated":[90],"within":[91],"unless":[92],"P=NP,":[93],"provide":[95],"fast":[97],"polynomial":[98],"time":[99],"deterministic":[100],"approximation":[101],"algorithm":[102],"performance":[104],"ratio":[105],".":[106]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}