{"id":"https://openalex.org/W2067344353","doi":"https://doi.org/10.1007/bf00264613","title":"On efficient implementation of an approximation algorithm for the Steiner tree problem","display_name":"On efficient implementation of an approximation algorithm for the Steiner tree problem","publication_year":1990,"publication_date":"1990-03-01","ids":{"openalex":"https://openalex.org/W2067344353","doi":"https://doi.org/10.1007/bf00264613","mag":"2067344353"},"language":"en","primary_location":{"id":"doi:10.1007/bf00264613","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00264613","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","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/A5111594900","display_name":"LawrenceT. Kou","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"LawrenceT. Kou","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Computer Science Division, University of California, 95616, Davis, Davis, CA, USA","university of california, davis"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Computer Science Division, University of California, 95616, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"university of california, davis","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111594900"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.0706,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86073273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","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.9987000226974487,"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.9987000226974487,"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/T11106","display_name":"Data Management and Algorithms","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9954000115394592,"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.8387348651885986},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7586804628372192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6754205226898193},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6346036791801453},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5519405007362366},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.546291172504425},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5281842947006226},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5280231833457947},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5017778873443604},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4815928637981415},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.46805280447006226},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.46195104718208313},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44261908531188965},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4341374933719635},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.4183548092842102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38502752780914307},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3732221722602844},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1746235191822052},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06747320294380188}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8387348651885986},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7586804628372192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6754205226898193},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6346036791801453},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5519405007362366},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.546291172504425},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5281842947006226},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5280231833457947},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5017778873443604},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4815928637981415},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.46805280447006226},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.46195104718208313},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44261908531188965},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4341374933719635},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4183548092842102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38502752780914307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3732221722602844},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1746235191822052},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06747320294380188}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00264613","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00264613","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"Acta Informatica","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":16,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1975290397","https://openalex.org/W1977726270","https://openalex.org/W1990317614","https://openalex.org/W1993553699","https://openalex.org/W2007503572","https://openalex.org/W2008771115","https://openalex.org/W2041786457","https://openalex.org/W2066194644","https://openalex.org/W2086709935","https://openalex.org/W2094076885","https://openalex.org/W2163169902","https://openalex.org/W2169528473","https://openalex.org/W2401610261","https://openalex.org/W3127447045"],"related_works":["https://openalex.org/W1990317614","https://openalex.org/W1975290397","https://openalex.org/W3127447045","https://openalex.org/W2586554544","https://openalex.org/W1568391568","https://openalex.org/W1503036335","https://openalex.org/W1481078828","https://openalex.org/W2113286397","https://openalex.org/W2587838583","https://openalex.org/W1996753220","https://openalex.org/W1552177397","https://openalex.org/W2139311061","https://openalex.org/W1988573007","https://openalex.org/W55191700","https://openalex.org/W2070664846","https://openalex.org/W2146459980","https://openalex.org/W1868361628","https://openalex.org/W2110559866","https://openalex.org/W2231625632","https://openalex.org/W1975444413"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}