{"id":"https://openalex.org/W2012130001","doi":"https://doi.org/10.1007/bf01187035","title":"An 11/6-approximation algorithm for the network steiner problem","display_name":"An 11/6-approximation algorithm for the network steiner problem","publication_year":1993,"publication_date":"1993-05-01","ids":{"openalex":"https://openalex.org/W2012130001","doi":"https://doi.org/10.1007/bf01187035","mag":"2012130001"},"language":"en","primary_location":{"id":"doi:10.1007/bf01187035","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01187035","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":true,"oa_status":"gold","oa_url":"https://ibn.idsi.md/vizualizare_articol/184409","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072751459","display_name":"Alex Zelikovsky","orcid":"https://orcid.org/0000-0003-4424-4691"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Z. Zelikovsky","raw_affiliation_strings":["Institute of Mathematics, Grosul 5, 277028, Kishinev, Moldova","Institute of Mathematics, Kishinev, Moldova"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Grosul 5, 277028, Kishinev, Moldova","institution_ids":[]},{"raw_affiliation_string":"Institute of Mathematics, Kishinev, Moldova","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072751459"],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":12.9322,"has_fulltext":false,"cited_by_count":338,"citation_normalized_percentile":{"value":0.99289255,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"9","issue":"5","first_page":"463","last_page":"470"},"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.9990000128746033,"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.9990000128746033,"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.9958000183105469,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9706000089645386,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.9468264579772949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7193464636802673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6752120852470398},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6130632758140564},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6104446053504944},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6052771806716919},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5481690168380737},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45547792315483093},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4341604709625244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.333757221698761}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9468264579772949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7193464636802673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6752120852470398},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6130632758140564},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6104446053504944},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6052771806716919},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5481690168380737},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45547792315483093},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4341604709625244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.333757221698761}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01187035","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01187035","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"},{"id":"pmh:oai:ibn.idsi.md:184409","is_oa":true,"landing_page_url":"https://ibn.idsi.md/vizualizare_articol/184409","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica  463-470","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ibn.idsi.md:184409","is_oa":true,"landing_page_url":"https://ibn.idsi.md/vizualizare_articol/184409","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica  463-470","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1975290397","https://openalex.org/W1975442866","https://openalex.org/W1990317614","https://openalex.org/W2067344353","https://openalex.org/W2172222998","https://openalex.org/W2401610261","https://openalex.org/W3148632216","https://openalex.org/W6641851398"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":{"An":[0,43],"instance":[1],"of":[2,8,18,30,38,73,81],"the":[3,20,31,59,66,70,74,78],"Network":[4],"Steiner":[5,28,53],"Problem":[6],"consists":[7],"an":[9],"undirected":[10],"graph":[11],"with":[12],"edge":[13,71],"lengths":[14],"and":[15],"a":[16,25],"subset":[17,33,37,80],"vertices;":[19],"goal":[21],"is":[22,49,65,69,77],"to":[23],"find":[24],"minimum":[26,35],"cost":[27,36],"tree":[29,54],"given":[32,79],"(i.e.,":[34],"edges":[39],"which":[40],"spans":[41],"it).":[42],"11/6-approximation":[44],"algorithm":[45],"for":[46],"this":[47],"problem":[48],"given.":[50],"The":[51],"approximate":[52],"can":[55],"be":[56],"computed":[57],"in":[58],"time0(\u00a6V\u00a6":[60],"\u00a6E\u00a6":[61],"+":[62],"\u00a6S\u00a64),":[63],"whereV":[64],"vertex":[67],"set,E":[68],"set":[72],"graph,":[75],"andS":[76],"vertices.":[82]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":12}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}