{"id":"https://openalex.org/W2171603211","doi":"https://doi.org/10.1007/s00453-001-0089-4","title":"Approximations for a Bottleneck Steiner Tree Problem","display_name":"Approximations for a Bottleneck Steiner Tree Problem","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2171603211","doi":"https://doi.org/10.1007/s00453-001-0089-4","mag":"2171603211"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0089-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0089-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5065315257","display_name":"Lusheng Wang","orcid":"https://orcid.org/0000-0002-4344-8791"},"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":"Wang","raw_affiliation_strings":["Department of Computer Science,  City University of Hong Kong, Kowloon Tong, Hong Kong.  \\{dzd, wangl\\}@cs.cityu.edu.hk., HK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  City University of Hong Kong, Kowloon Tong, Hong Kong.  \\{dzd, wangl\\}@cs.cityu.edu.hk., HK","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101460981","display_name":"Zhaodong Du","orcid":"https://orcid.org/0000-0003-3339-562X"},"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":false,"raw_author_name":"-Z. Du","raw_affiliation_strings":["Department of Computer Science,  City University of Hong Kong, Kowloon Tong, Hong Kong.  \\{dzd, wangl\\}@cs.cityu.edu.hk., HK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  City University of Hong Kong, Kowloon Tong, Hong Kong.  \\{dzd, wangl\\}@cs.cityu.edu.hk., HK","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065315257"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6849,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.72849013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"4","first_page":"554","last_page":"561"},"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.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7849102020263672},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.758495569229126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6786025762557983},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.672910213470459},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6539757251739502},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6505452990531921},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6232053637504578},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.607262909412384},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6008113622665405},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5761661529541016},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5726004838943481},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.529998242855072},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4724750220775604},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4665619432926178},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4121939241886139},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22674232721328735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1779923439025879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1503717601299286},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14587369561195374},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1153896152973175}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7849102020263672},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.758495569229126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6786025762557983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.672910213470459},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6539757251739502},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6505452990531921},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6232053637504578},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.607262909412384},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6008113622665405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5761661529541016},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5726004838943481},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.529998242855072},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4724750220775604},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4665619432926178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4121939241886139},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22674232721328735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1779923439025879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1503717601299286},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14587369561195374},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1153896152973175},{"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/s00453-001-0089-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0089-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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":18,"referenced_works":["https://openalex.org/W109985799","https://openalex.org/W1525228936","https://openalex.org/W1570063718","https://openalex.org/W1984458273","https://openalex.org/W1999154739","https://openalex.org/W2020112047","https://openalex.org/W2042492403","https://openalex.org/W2060380213","https://openalex.org/W2069002708","https://openalex.org/W2069742756","https://openalex.org/W2086709935","https://openalex.org/W2100961486","https://openalex.org/W2110367141","https://openalex.org/W2114753568","https://openalex.org/W2122877872","https://openalex.org/W2128456629","https://openalex.org/W2145965938","https://openalex.org/W2161071733"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224","https://openalex.org/W1998126097"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}