{"id":"https://openalex.org/W2032228390","doi":"https://doi.org/10.1016/0020-0190(93)90201-j","title":"A faster approximation algorithm for the steiner tree problem in graphs","display_name":"A faster approximation algorithm for the steiner tree problem in graphs","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W2032228390","doi":"https://doi.org/10.1016/0020-0190(93)90201-j","mag":"2032228390"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(93)90201-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(93)90201-j","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[{"id":"https://openalex.org/I112090838","display_name":"Academy of Sciences of Moldova","ror":"https://ror.org/01w01n720","country_code":"MD","type":"funder","lineage":["https://openalex.org/I112090838"]}],"countries":["MD"],"is_corresponding":true,"raw_author_name":"Alexander Z. Zelikovsky","raw_affiliation_strings":["Institute of Mathematics, Academy of Sciences, Akademiei 5, Kishinev 277028, Moldova"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Academy of Sciences, Akademiei 5, Kishinev 277028, Moldova","institution_ids":["https://openalex.org/I112090838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072751459"],"corresponding_institution_ids":["https://openalex.org/I112090838"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":3.6487,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.93107713,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"46","issue":"2","first_page":"79","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9904999732971191,"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.8934450149536133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7340863943099976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5651529431343079},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5607081651687622},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5552399754524231},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49012693762779236},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48294705152511597},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44179767370224},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4411822557449341},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4379810094833374},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.432079553604126},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41778823733329773},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4007970094680786},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3737378716468811},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3734883666038513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36749303340911865},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1982135772705078},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15263861417770386},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.0703098475933075}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8934450149536133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7340863943099976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5651529431343079},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5607081651687622},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5552399754524231},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49012693762779236},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48294705152511597},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44179767370224},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4411822557449341},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4379810094833374},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.432079553604126},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41778823733329773},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4007970094680786},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3737378716468811},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3734883666038513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36749303340911865},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1982135772705078},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15263861417770386},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.0703098475933075}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(93)90201-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(93)90201-j","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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":15,"referenced_works":["https://openalex.org/W1185775471","https://openalex.org/W1975442866","https://openalex.org/W1990317614","https://openalex.org/W2003882909","https://openalex.org/W2011999472","https://openalex.org/W2066356146","https://openalex.org/W2084224084","https://openalex.org/W2157338118","https://openalex.org/W2754301405","https://openalex.org/W3127447045","https://openalex.org/W6627950866","https://openalex.org/W6644040475","https://openalex.org/W6651557389","https://openalex.org/W6682909812","https://openalex.org/W6789680617"],"related_works":["https://openalex.org/W3047993683","https://openalex.org/W1997570556","https://openalex.org/W2145730188","https://openalex.org/W1590242304","https://openalex.org/W2914161519","https://openalex.org/W1514905840","https://openalex.org/W2030879379","https://openalex.org/W2067344353","https://openalex.org/W2412875519","https://openalex.org/W2032228390"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}